请输入您要查询的字词:

 

单词 EliminatedSierpinskiNumberCandidates
释义

eliminated Sierpiński number candidates


Most numbers k are very easy to eliminate as Sierpiński number candidates, as it is very easy to come up with sequences of primes of the form k2n+1. For example, for k=1 it is enough to mention the Fermat primesMathworldPlanetmath. For some of the seventeen Sierpiński number candidates when the Seventeen or Bust project began, only a single Proth primeMathworldPlanetmath, and it is often quite large. Eight candidates remain to be eliminated. The primes listed below were discovered by the Seventeen or Bust project, with the latest being for 19249, discovered by user Konstantin Agafonov of team TSC! Russia.

随便看

 

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

 

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