MathLabs

Problem 5

Find all triples (a,b,p)(a,b,p) of positive integers with pp prime and ap=b!+pa^p=b!+p
Step 6 of 6: Rule out p≥5p\ge5 with a Zsigmondy prime
b!=pp−p=p(p−1)(1+p+⋯+pp−2)b!=p^p-p=p(p-1)(1+p+\cdots+p^{p-2})
Detailed analysis

For p≥5p\ge5, write b!=p(pp−1−1)=p(p−1)(1+p+⋯+pp−2)b!=p(p^{p-1}-1)=p(p-1)(1+p+\cdots+p^{p-2}). Zsigmondy's theorem gives a primitive prime divisor qq of pp−1−1p^{p-1}-1; its multiplicative order modulo qq is p−1p-1, so q≡1(modp−1)q\equiv1\pmod{p-1}. Thus q≥2p−1>2p−2≥bq\ge2p-1>2p-2\ge b, and q≠pq\ne p, contradicting q∣b!q\mid b!. Hence no solutions exist for p≥5p\ge5.