Zsigmondy's theorem
From Wikipedia, the free encyclopedia
In number theory, the Zsigmondy's theorem states that if a>b>0 are coprime integers, then for any natural number n>1 there is a prime number p (called primitive prime divisor) that divides an-bn and does not divide ak-bk for all k<n, with the following exceptions:
- a=2, b=1, n=6;
- a+b is a power of two and n=2.