need help to prove euler's problem on prime numbers in gelfand algebra text.
55060
Prove that $n^2+n+41$ is prime for $n<40$
5978
Prove that there exists only one prime number of the form $p^2−1$ where $p≥2$ is an integer
57944
Euler's Formula application for distinct odd primes with gcd 1
17690
Ways to prove Euler's formula for $\zeta(2n)$
16172
My proof of $I \otimes N \cong IN$ is clearly wrong, but where have I gone wrong?
58182
How to prove that $\mathbb{Q}[\sqrt{p_1}, \sqrt{p_2}, \ldots,\sqrt{p_n} ] = \mathbb{Q}[\sqrt{p_1}+ \sqrt{p_2}+\cdots + \sqrt{p_n}]$, for $p_i$ prime?
23523
Two problems on number theory
136310
Prime number in a polynomial expression
143772
How can I algebraically prove that $2^n - 1$ is not always prime?
137858
Showing that $\mathbb{Z}[i]/I$ is a finite field whenever $I$ is a prime ideal, and also finding its cardinality?
131488
Show that $p^3+4$ is prime
65511
Proving the following false: $f(x)=2x+1$ produces a prime number if and only if x is prime
53426
Proof of a formula involving Euler's totient function: $\varphi (mn) = \varphi (m) \varphi (n) \cdot \frac{d}{\varphi (d)}$
2593
Proof for Mersenne primes?
18302
List the primes for which the following system of linear equations DOES NOT have a solution in $\mathbb{Z}_p$
63769
Group theory proof of Euler's theorem ($a^{\phi(m)} \equiv 1\mbox{ }(\mbox{mod }m)$ if $\gcd(a,m)=1$)
98722
Understanding Euclid's proof that the number of primes is infinite.