Feit–Thompson conjecture

From Wikipedia, the free encyclopedia
(Redirected from Feit-thompson conjecture)
Jump to navigation Jump to search

Template:Short description In mathematics, the Feit–Thompson conjecture is a conjecture in number theory, suggested by Walter Feit and John G. Thompson (1962). The conjecture states that there are no distinct prime numbers p and q such that

pq1p1 divides qp1q1.

If the conjecture were true, it would greatly simplify the final chapter of the proof Script error: No such module "Footnotes". of the Feit–Thompson theorem that every finite group of odd order is solvable. A stronger conjecture that the two numbers are always coprime was disproved by Script error: No such module "Footnotes". with the counterexample p = 17 and q = 3313 with common factor 2pq + 1 = 112643.

It is known that the conjecture is true for q = 2 Script error: No such module "Footnotes". and q = 3 Script error: No such module "Footnotes"..

Informal probability arguments suggest that the "expected" number of counterexamples to the Feit–Thompson conjecture is very close to 0, suggesting that the Feit–Thompson conjecture is likely to be true.

See also

References

<templatestyles src="Reflist/styles.css" />

Script error: No such module "Check for unknown parameters".

  • Script error: No such module "citation/CS1". MRTemplate:Catalog lookup link
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".
  • Script error: No such module "citation/CS1".

External links

  • Script error: No such module "Template wrapper". (This article confuses the Feit–Thompson conjecture with the stronger disproved conjecture mentioned above.)