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 $k2^{n}+1$ . For example, for $k=1$ it is enough to mention the Fermat primes. For some of the seventeen Sierpiński number candidates when the Seventeen or Bust project began, only a single Proth prime, 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.

单词	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 $k2^{n}+1$ . For example, for $k=1$ it is enough to mention the Fermat primes. For some of the seventeen Sierpiński number candidates when the Seventeen or Bust project began, only a single Proth prime, 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.
随便看	Minkowski space MinkowskisTheorem MinkowskiSum Minkowski sum Minkowski’s constant Minkowski’s theorem MinorofAGraph minor (of a graph) MinorofAMatrix minor (of a matrix) MinusOneTimesAnElementIsTheAdditiveInverseInARing minus one times an element is the additive inverse in a ring MiquelPoint Miquel point MiracleOctadGenerator miracle octad generator MirrorImageOfAKnot mirror image of a knot MittagLefflerFunction Mittag-Leffler function MittagLefflersTheorem Mittag-Leffler’s theorem MixedFraction mixed fraction MixedGroup