- #1
Wiz14
- 20
- 0
Let p be a prime number and 1 <= a < p be an integer.
Prove that a divides p + 1 if and only if there exist integers m and n such that
a/p = 1/m + 1/n
My solution: a|p+1 then there exists an integer m such that am = p+1
Dividing by mp
a/p = 1/m + 1/mp
So if I choose n = mp(which is always an integer) am I done?
Prove that a divides p + 1 if and only if there exist integers m and n such that
a/p = 1/m + 1/n
My solution: a|p+1 then there exists an integer m such that am = p+1
Dividing by mp
a/p = 1/m + 1/mp
So if I choose n = mp(which is always an integer) am I done?