请输入您要查询的字词:

 

单词 FeitThompsonConjecture
释义

Feit-Thompson conjecture


Conjecture (Walter Feit & John Thompson). There are no prime numbersMathworldPlanetmath p and q (with pq) such that pq-1p-1 is divisible by qp-1q-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

gcd(pq-1p-1,qp-1q-1)=1

always, and then found the counterexample p=17, q=3313. The numbers 173313-117-1 and 331317-13313-1 do have 112643 as their greatest common divisorMathworldPlanetmathPlanetmath, 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 ConjectureMathworldPlanetmathMath. of Computation 25 115 (1971): 625
随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 9:34:15