Erdős's conjecture on the smallest prime divisors of Sierpiński sequences
Statement
Let be a Sierpiński number, meaning that is composite for every positive integer . For each positive integer , let the smallest prime divisor of be the least prime dividing that integer. Erdős's conjecture. The smallest prime divisor of remains bounded as 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.