Sur un problème concernant les nombres \(k\cdot2^n+1\)¶
Sierpiński, W. (1960). Sur un problème concernant les nombres \(k\cdot2^n+1\). Elemente der Mathematik.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Covering Set
- Sierpiński proved in 1960 that infinitely many odd \(k\) make every \(k2^n+1\) composite by combining a complete system of exponent congruences with compatible congruences on \(k\).
This sourcePrimary source for the finite congruence construction proving that infinitely many odd parameters produce all-composite \(k2^n+1\) sequences.
- Sierpiński proved in 1960 that infinitely many odd \(k\) make every \(k2^n+1\) composite by combining a complete system of exponent congruences with compatible congruences on \(k\).
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:fd810470fff2 · see in the full table