Feit-Thompson conjecture: Difference between revisions

From Groupprops
(Created page with '==Statement== The conjecture states that if <math>p,q</math> are distinct primes, then <math>\Phi_p(q) = (q^p - 1)/(q - 1)</math> does ''not'' divide <math>\Phi_q(p) = (p^q - 1)...')
 
 
Line 8: Line 8:


* [[Odd-order implies solvable|Feit-Thompson theorem]]: The proof of the theorem by Feit and Thompson that every group of odd order is solvable can be simplified considerably if the Feit-Thompson conjecture is true.
* [[Odd-order implies solvable|Feit-Thompson theorem]]: The proof of the theorem by Feit and Thompson that every group of odd order is solvable can be simplified considerably if the Feit-Thompson conjecture is true.
==References==
===Journal references===
* {{paperlink|FeitThompsonAnnouncement}}
* {{paperlink|FeitThompson}}
* {{paperlink|StephensonFT}}


==External links==
==External links==

Latest revision as of 14:21, 28 April 2009

Statement

The conjecture states that if p,q are distinct primes, then Φp(q)=(qp1)/(q1) does not divide Φq(p)=(pq1)/(p1).

The stronger conjecture that Φp(q) and Φq(p) are relatively prime is false. The smallest counterexample is p=17,q=3313.

Related facts

  • Feit-Thompson theorem: The proof of the theorem by Feit and Thompson that every group of odd order is solvable can be simplified considerably if the Feit-Thompson conjecture is true.

References

Journal references

External links

Subject wiki links