OIM 1990 Problem 3
Let , be integer numbers, and define .
i) If is a prime number such that is divisible by but not by , show that for every integer , is not divisible by .
ii) Let be a prime divisor of . If divides for some integer , show that for every integer there exists an integer such that is divisible by .
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.