Zsigmondy Theorem
- Mathematics & Logic -
Pure Mathematics Dictionary
Definition
A theorem in arithmetic number theory that for integers a>b>0 with gcd(a,b)=1 and for integer n>1, the integer a^n−b^n has a primitive prime divisor (a prime dividing a^n−b^n but not dividing a^k−b^k for any 1≤k