All Questions
2
questions
0
votes
3
answers
344
views
Euler's product formula in number theory
Is there intuitive proof of Euler's product formula in number theory (not searching for probabilistic proof) which is used to compute Euler's totient function?
- 1,276
1
vote
1
answer
823
views
How to find modulo using Euler theorem?
I don't know how that's possible using phi, the question starts with this one:
a) Decompose 870 in prime factors and compute, ϕ(870)
I know how to resolve this, first 870 = 2*3*5*29 and ϕ(870)= ...
- 31