ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k≥4k\geq 4, let nn be an integer, and let p(k)p^{(k)} denote the smallest prime greater than or equal to kk. The product of kk consecutive integers is

(n+1)⋯(n+k).(n+1)\cdots(n+k).

Erdős–Selfridge conjecture. If n+k≥p(k)n+k\geq p^{(k)}, then there is a prime greater than kk which divides (n+1)⋯(n+k)(n+1)\cdots(n+k) to the first power.

This conjecture is attributed in the source to Erdős and Selfridge and is stated because it implies the index divisor free prime conjecture when k≥5k\geq 5 and kk is not prime. Its resolution status is not specified in the supplied text.

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.