Problem 5
Does there exist a positive integer such that has exactly distinct prime divisors and divides ?
Step 4 of 5: Preserve divisibility
Detailed analysis
Modulo n use that p is odd; modulo p use p congruent to 1 modulo 2n, then apply the Chinese remainder theorem.