ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let tt and dd be positive integers, with tt odd and d≥2d\geq 2. Consider the integer sequence with general term

⌊ntd⌋.\left\lfloor\frac{n^t}{d}\right\rfloor.

Prime-value conjecture for odd powers. (a) If t≡0(mod3)t\equiv 0\pmod 3 and d≠2,9d\neq 2,9, then there are infinitely many primes of the form

⌊ntd⌋.\left\lfloor\frac{n^t}{d}\right\rfloor.

(b) If t≢0(mod3)t\not\equiv 0\pmod 3 and d≠2d\neq 2, then there are infinitely many primes of the form

⌊ntd⌋.\left\lfloor\frac{n^t}{d}\right\rfloor.

The paper has already established that the excluded cases d=2d=2 and, when 3∣t3\mid t, d=9d=9 yield eventually prime-free sequences. The conjecture proposes that these are the only such exceptions among odd exponents, while the asserted infinitude of prime values remains 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.