Browse · MathNet
PrintXXV OBM
Brazil number theory
Problem
Find the smallest positive prime that divides for some integer .
Solution
Let . For we get . Observe that , so this only involves calculating 7 terms. None of these are divisible by any of . But all possible values mod are assumed by for any 13 consecutive integers, similarly for 11, 7 etc. So is not divisible by for any . On the other hand . So the answer is .
Final answer
17
Techniques
Polynomials mod pPrime numbers