Feit-Thompson conjecture
Conjecture (Walter Feit & John Thompson). There are no prime numbers^{} $p$ and $q$ (with $p\ne q$) such that $\frac{{p}^{q}-1}{p-1}$ is divisible by $\frac{{q}^{p}-1}{q-1}$.
Feit and Thompson, in regards to the Feit-Thompson theorem, have said that proving this conjecture would simplify their proof of their theorem, “rendering unnecessary the detailed use of generators and relations.” In 1971, Stephens strengthened the conjecture to state that
$$\mathrm{gcd}(\frac{{p}^{q}-1}{p-1},\frac{{q}^{p}-1}{q-1})=1$$ |
always, and then found the counterexample $p=17$, $q=3313$. The numbers $\frac{{17}^{3313}-1}{17-1}$ and $\frac{{3313}^{17}-1}{3313-1}$ do have 112643 as their greatest common divisor^{}, but dividing the former by the latter leaves a remainder of 149073454345008273252753518779212742886488244343395482423. No other counterexamples have been found to Stephen’s stronger version of the conjecture.
References
- 1 N. M. Stephens, “On the Feit-Thompson Conjecture^{}” Math. of Computation 25 115 (1971): 625
Title | Feit-Thompson conjecture |
---|---|
Canonical name | FeitThompsonConjecture |
Date of creation | 2013-03-22 17:55:38 |
Last modified on | 2013-03-22 17:55:38 |
Owner | PrimeFan (13766) |
Last modified by | PrimeFan (13766) |
Numerical id | 8 |
Author | PrimeFan (13766) |
Entry type | Conjecture |
Classification | msc 20A05 |
Classification | msc 20E32 |