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 sourceVerified 2026-08-26. Primary 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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:fd810470fff2 · see in the full table