# Number Theory Questions and Answers

Filter Questions

» Browse Popular Topics
• Math
Firstly, show that `2^52` and `3^52` are congruent to 1 (mod 53).` ` According to the definition of Euler's phi function, that it equals the number of coprimes less than or equal to n, `phi(53) =...

Asked by freedomfreedom on via web

• Math
Euler's product formula states that `prod_(p quad "prime") 1/(1-p^(-s)) = sum_(k=1)^infty 1/k^s` So if we have that `sum_(k=1)^infty 1/k^2 = prod_(p quad "prime")1/(1-p^(-s))` for `s in...

Asked by user7230927 on via web

• Math
Euler's Theorem says that if `a` and `n` are relatively prime, or coprime, then `a^(phi(n)) -= 1` `mod n` where `phi(n)` is Euler-s phi function (this gives the number of numbers less than or...

Asked by svjr on via web

• Math
The definition of Euler's `phi` function is that `phi(n)` equals the number of positive integers less than or equal to `n` that are coprime, or relatively prime to `n`. Coprimes have a greatest...

Asked by svjr on via web