Cloitre's conjecture on the primes occurring in the least-common-multiple sequence

About 11 years old · traced to

Let ana_n and bnb_n be defined by

an={1for n=1,an−1+lcm⁡(n,an−1)for n≥2,a_n=\begin{cases}1&\text{for }n=1,\\a_{n-1}+\operatorname{lcm}(n,a_{n-1})&\text{for }n\geq2,\end{cases}

and bn=an/an−1−1b_n=a_n/a_{n-1}-1 for n≥2n\geq2. Cloitre's prime-occurrence conjecture. The sequence (bn)(b_n) contains every prime number other than 33, which never appears. The paper says this conjecture is proved in its Section 3, using two propositions; in particular, for every prime distinct from 33, bp=pb_p=p, and the paper establishes that 33 does not occur.

References

Primary source

Serafín Ruiz-Cabello, “On the use of the least common multiple to build a prime-generating recurrence”, arXiv:1504.05041 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.