ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (an)(a_n) be defined by

a1=1,a_1=1,

and

an=an−1+lcm⁡(n,an−1)(n≥2).a_n=a_{n-1}+\operatorname{lcm}(n,a_{n-1})\qquad(n\geq 2).

Define the multiplicative increments

bn=anan−1−1=ngcd⁡(n,an−1).b_n=\frac{a_n}{a_{n-1}}-1=\frac{n}{\operatorname{gcd}(n,a_{n-1})}.

Prime-increment conjecture. For every n≥2n\geq 2, we have bn∈{1}∪Pb_n\in\{1\}\cup\mathbb{P}, where P\mathbb{P} denotes the set of prime numbers.

Numerical evidence supports the claim, but a proof for every nn remains open. The paper proves unconditionally that the claim holds for a set of integers of asymptotic density 11, using a Companion--Sieve framework, the Bombieri--Vinogradov theorem, and elementary sieve bounds.

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.