ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be a Sierpiński number, meaning that k⋅2n+1k\cdot 2^n+1 is composite for every positive integer nn. For each positive integer nn, let the smallest prime divisor of k⋅2n+1k\cdot 2^n+1 be the least prime dividing that integer. Erdős's conjecture. The smallest prime divisor of k⋅2n+1k\cdot 2^n+1 remains bounded as nn tends to infinity. This conjecture concerns whether the prime divisors witnessing the compositeness of a Sierpiński sequence can always be chosen from a bounded set; the supplied text gives no resolution, so its status is open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.