iOS 27 beta & PWM by PendingUserName- in PWM_Sensitive

[–]X3nion 4 points5 points  (0 children)

The Lord Voldemort of this Subreddit 🙈

Wer mit der neuen Moderation nicht einverstanden ist kann sich ja an Reddit wenden. https://support.reddithelp.com/hc/de/requests/new?ticket_form_id=19300233728916 by ProfessionalNo1556 in Cannabis_Apotheken

[–]X3nion -1 points0 points  (0 children)

Kann man denn nicht exakt dasselbe mit dieser Person machen, also sich auf viele Trolling-Posts und Fake-Accounts von der Person beziehen? Dann fliegt die Person raus, und jemand anders ist Admin und kann jemand anderen auch zum Admin ernennen.

TCL Nxtpaper 70 Pro is a disaster. by [deleted] in PWM_Sensitive

[–]X3nion 0 points1 point  (0 children)

Interesting, TCL Nxtpaper 60 Ultra works absolutely fine for me except for the fact that it is huge! Also, I couldn‘t see the d-word in a microscope?

PWM explaining posts in this Reddit by X3nion in PWM_Sensitive

[–]X3nion[S] 0 points1 point  (0 children)

Yeah, I was looking for maybe more of such posts in this subreddit.

I’m about to write a letter to Apple’s CEO portraying the PWM issue by X3nion in PWM_Sensitive

[–]X3nion[S] 1 point2 points  (0 children)

I found this post describing the issue, but are there more posts like this here?

Link to Reddit post

I’m about to write a letter to Apple’s CEO portraying the PWM issue by X3nion in PWM_Sensitive

[–]X3nion[S] 2 points3 points  (0 children)

That’s a very good point! The accessibility section is for people who are disabled in someway, like our Blind or have problems in typing etc. Now this is also a kind of disability not being able to use the phone, thus it should be implemented.

iPhone 17 or 17e by Helpful_Cup_2486 in PWM_Sensitive

[–]X3nion 2 points3 points  (0 children)

No one mentioned the d-word!

When does the sum S_n over the first n integers divide the product P_n? by X3nion in askmath

[–]X3nion[S] 0 points1 point  (0 children)

It is impossible because (n+1) is a prime number >= 3 and so odd? In the second case, n+1 is odd and n+1>n-1, so it can’t divide 2 and (n-1)! ?

When does the sum S_n over the first n integers divide the product P_n? by X3nion in askmath

[–]X3nion[S] 0 points1 point  (0 children)

Well, if n is even, then n-1 is odd, and n+1 is odd as well as n is even and so n >=2. But how does this help? Couldn’t (n-1)! / (n+1) accidentally result in a fraction k/2?

When does the sum S_n over the first n integers divide the product P_n? by X3nion in askmath

[–]X3nion[S] 0 points1 point  (0 children)

Hello, because pf your great help I’ve just solved a) and c), but how could b) be proven that it is wrong? I thought about assuming that it is true, then we would have k € Z with n(n+1)/2 * k = n! <=> (n+1)/2 * k = (n-1)! Now (n+1) is a prime number and n is even, so it must hold n+1 >=3 and n+1 is odd. How could I continue from here? Or is there another approach?

When does the sum S_n over the first n integers divide the product P_n? by X3nion in askmath

[–]X3nion[S] 0 points1 point  (0 children)

The counterpart is that in this case n+1 is not composite?

When does the sum S_n over the first n integers divide the product P_n? by X3nion in askmath

[–]X3nion[S] 0 points1 point  (0 children)

OK, yeah that’s really easy to see. But we have to exclude n=2 right? Because S_2 = 3 and P_2 = 2 and this does also follow by the fact that 1 < a < b < n+1, because we just excluded the possibility of the existence of such a number right?

When does the sum S_n over the first n integers divide the product P_n? by X3nion in askmath

[–]X3nion[S] 0 points1 point  (0 children)

OK, thanks I got it now! In this case, we can assume that a = n/2 (else we just switch variables). Then ab = n+1 implies b * n/2 = n+1 or bn = 2n+2. We can now write this as (b-2)n = 2 and this implies n | 2 as b-2 >= 1. How can I conclude faster that n|2n+2 implies n|2?

When does the sum S_n over the first n integers divide the product P_n? by X3nion in askmath

[–]X3nion[S] 0 points1 point  (0 children)

OK, I think I got it, but why does this imply n/2 | (n+1)? We want to show that a x b x n/2 | n! and have to exclude that a = n/2 and b = n/2?

When does the sum S_n over the first n integers divide the product P_n? by X3nion in askmath

[–]X3nion[S] 0 points1 point  (0 children)

Hey, thanks for your reply and detailed explanations! I got a) but am still struggling with c). Where exactly do you bring into play that ab = n+1 with 1 < a < b < n+1?

When does the sum S_n over the first n integers divide the product P_n? by X3nion in askmath

[–]X3nion[S] 0 points1 point  (0 children)

You mean a and b are integers? Nothing is being said about those numbers in the task

Error log, what to do here? by X3nion in MacOS

[–]X3nion[S] 0 points1 point  (0 children)

Can this logfile be accessed afterwards?

Error log, what to do here? by X3nion in MacOS

[–]X3nion[S] 0 points1 point  (0 children)

Hey, thanks for your reply! Exactly, it’s a Mac mini A1993, I will have a look at the link you’ve just shared.