ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix some integer nn and define a decreasing sequence in [1,n)[1,n) by a1=n−1a_1=n-1 and, for k≥2k\geq 2, letting aka_k be the greatest integer in [1,ak−1)[1,a_{k-1}) such that all of the prime factors of aka_k are >n−ak>n-a_k. Is it true that, for sufficiently large nn, not all of this sequence can be prime?

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.