Summing (0,1) uniform random variables up to 1 [duplicate] Possible Duplicate: choose a random number between 0 and 1 and record its value and keep doing it until the sum of the numbers exceeds 1 how many tries? So I'm reading a book about simulation
Prove that the sequence (1+1 n)^n is convergent [duplicate] I know the proof using binomial expansion and then by monotone convergence theorem But i want to collect some other proofs without using the binomial expansion *if you could provide the answer w
Prove that the order of $U (n)$ is even when $n gt;2$. Right! I like that: $ (n-1)^2=n^2-2n+1=n (n-2)+1 \equiv 1 (\bmod {n})$ I was skeptical of the line "However, we know (I forgot the theorem's name) that the number of elements of order 2 is divisible by ϕ (2)=1 " I could replace it with "Since $ (n-1)^2 \equiv 1 (\bmod {n})$, then there is at least one element of order $2$ in $|U (n)|$ " What do you think about the proof with that change?
Proof that $U (n)$ is connected - Mathematics Stack Exchange Thanks for the link @muzzlator I've just had a look at it and it's very interesting (and seems a lot simpler), however it uses methods a little different to those that I have been using for the course I am studying