Given are distinct odd primes . Show that has at least 3 distinct prime divisors.
No idea how to approach this one, so I would gladly use a hint and try to get at it myself. Thank you in advance.
In my opinion you should try the Chinese remainder theorem... (But maybe I wrong here)
Or by using Euler's theorem (Euler's theorem - Wikipedia, the free encyclopedia), prove that for every combination of (under conditions) exist such that , when your primes...
Interesting...