In number theory, Zsigmondy's theorem, named after Karl Zsigmondy, states that if a>b>0 are coprime integers, then for any integer n \ge 1, there is a prime number p (called a primitive prime divisor) that divides a^n-b^n and does not divide a^k-b^k for any positive integer k<n, with the following exceptions: This generalizes Bang's theorem, which states that if n>1 and n is not equal to 6, then 2^n-1 has a prime divisor not dividing any 2^k-1 with k<n. Similarly, a^n+b^n has at least one primitive prime divisor with the exception 2^3+1^3=9. Zsigmondy's theorem is often useful, especially in group theory, where it is used to prove that various groups have distinct orders except when they are known to be the same.

History

The theorem was discovered by Zsigmondy working in Vienna from 1894 until 1925.

Generalizations

Let be a sequence of nonzero integers. The Zsigmondy set associated to the sequence is the set i.e., the set of indices n such that every prime dividing a_n also divides some a_m for some m < n. Thus Zsigmondy's theorem implies that, and Carmichael's theorem says that the Zsigmondy set of the Fibonacci sequence is , and that of the Pell sequence is {1}. In 2001 Bilu, Hanrot, and Voutier proved that in general, if is a Lucas sequence or a Lehmer sequence, then (see, there are only 13 such ns, namely 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 13, 18, 30). Lucas and Lehmer sequences are examples of divisibility sequences. It is also known that if is an elliptic divisibility sequence, then its Zsigmondy set is finite. However, the result is ineffective in the sense that the proof does not give an explicit upper bound for the largest element in , although it is possible to give an effective upper bound for the number of elements in.