Let be a natural number. Prove that if and only if .
Solution
Let . Clearly does not divide , so by Little Fermat's theorem we have that , i.e. .
Now we have , i.e. or , and because of we get .
Now let ; clearly does not divide , so as previously we have . We get , i.e. , i.e. , or , from where we have that , which concludes the proof.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.