On the use of the least common multiple to build a prime-generating recurrence
Combinatorics
2016-10-25 v3
Abstract
We study a recursively defined sequence which is constructed using the least common multiple. It has been conjectured that every term of that sequence is or a prime. In this paper we show that this claim is connected to a strong version of Linnik's Theorem, which is yet unproved. We also study a generalization on which composite numbers may appear depending on the initial term.
Keywords
Cite
@article{arxiv.1504.05041,
title = {On the use of the least common multiple to build a prime-generating recurrence},
author = {Serafín Ruiz-Cabello},
journal= {arXiv preprint arXiv:1504.05041},
year = {2016}
}
Comments
16 pages, 1 figure; multiple typos added, modified title, many other small corrections