All Questions
2
questions
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
2
votes
2
answers
165
views
Use congruences to factor $n=87463$ (Fermat's Factorization?)
I'm studying for my number theory test tomorrow, and these are the last questions in my study guide. I think I understand Fermat's factorization, however, I can't tell how my professor wants us to ...
- 55