Feit-Thompson conjecture

Feit-Thompson conjecture

In mathematics, the Feit-Thompson conjecture is a conjecture in number theory, suggested by harvs|txt=yes|first=Walter|last= Feit|authorlink=Walter Feit| first2=John G. |last2=Thompson|author2-link=John G. Thompson|year=1962. The conjecture states that there are no distinct prime numbers "p" and "q" for which

:frac{p^{q} - 1}{p - 1} mbox{ divides } frac{q^{p} - 1}{q - 1}.

If the conjecture were true, it would greatly simplify the final chapter of the proof harv|Feit|Thompson|1963 of the Feit-Thompson theorem that every finite group of odd order is solvable. A stronger (and rather implausible) conjecture that the two numbers are always coprime was disproved by harvtxt|Stephens|1971 with the counterexample "p" = 17 and "q" = 3313 with common factor 2"pq" + 1 = 112643.

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.

ee also

*Cyclotomic polynomials
*Goormaghtigh conjecture

References

* citation
last= Feit|first=Walter|last2=Thompson|first2= John G.
title = A solvability criterion for finite groups and some consequences
journal = Proc. Nat. Acad. Sci. U.S.A.
volume = 48
year = 1962
pages = 968–970
url= http://links.jstor.org/sici?sici=0027-8424%2819620615%2948%3A6%3C968%3AASCFFG%3E2.0.CO%3B2-Q MathSciNet|id=0143802
* citation
last= Feit|first=Walter|last2=Thompson|first2= John G.
title = Solvability of groups of odd order
journal = Pacific J. Math.
volume = 13
year = 1963
pages = 775–1029
issn = 0030-8730 MathSciNet|id=0166261
* citation
last = Stephens
first = Nelson M.
title = On the Feit-Thompson conjecture
journal = Math. Comp.
volume = 25
year = 1971
pages = 625
issn = 0025-5718
url=http://links.jstor.org/sici?sici=0025-5718%28197107%2925%3A115%3C625%3AOTFC%3E2.0.CO%3B2-H MathSciNet|id=0297686

External links

* (This article confuses the Feit-Thompson conjecture with the stronger disproved conjecture mentioned above.)


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Feit-Thompson — may refer to:* Feit Thompson conjecture * Feit Thompson theorem …   Wikipedia

  • Feit–Thompson theorem — In mathematics, the Feit–Thompson theorem, or odd order theorem, states that every finite group of odd order is solvable. It was proved by Walter Feit and John Griggs Thompson (1962, 1963) Contents 1 History 2 Significance of the proof …   Wikipedia

  • Goormaghtigh conjecture — In mathematics, the Goormaghtigh conjecture is a conjecture in number theory named for the mathematician René Goormaghtigh. The conjecture is that the only non trivial integer solutions of the exponential Diophantine equation:frac{x^m 1}{x… …   Wikipedia

  • Théorème de Feit et Thompson — En mathématiques, et plus précisément en théorie des groupes, le théorème de Feit et Thompson, appelé aussi théorème de l ordre impair, dit que tout groupe fini d ordre impair est résoluble, ce qui équivaut à dire que tout groupe simple fini non… …   Wikipédia en Français

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

  • CN group — In mathematics, in the area of algebra known as group theory, a more than fifty year effort was made to answer a conjecture of harv|Burnside|1911: are all groups of odd order solvable? Progress was made by showing that CA groups, groups in which… …   Wikipedia

  • List of conjectures — This is an incomplete list of mathematical conjectures. They are divided into four sections, according to their status in 2007. See also: * Erdős conjecture, which lists conjectures of Paul Erdős and his collaborators * Unsolved problems in… …   Wikipedia

  • List of group theory topics — Contents 1 Structures and operations 2 Basic properties of groups 2.1 Group homomorphisms 3 Basic types of groups …   Wikipedia

  • Parity (mathematics) — In mathematics, the parity of an object states whether it is even or odd. This concept begins with integers. An even number is an integer that is evenly divisible by 2, i.e., divisible by 2 without remainder; an odd number is an integer that is… …   Wikipedia

  • Impair — Parité (arithmétique) En arithmétique modulaire, étudier la parité d un entier, c est déterminer si cet entier est ou non un multiple de deux. Un entier multiple de deux est un entier pair, les autres sont les entiers impairs. Sommaire 1 Histoire …   Wikipédia en Français

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”