On the use of the least common multiple to build a prime-generating recurrence

DOI10.1142/S1793042117500439zbMath1422.11009arXiv1504.05041MaRDI QIDQ2978901

Serafín Ruiz-Cabello

Publication date: 2 May 2017

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.05041

zbMATH Keywords

divisibilityleast common multipleprime numberinteger sequence

Mathematics Subject Classification ID

Recurrences (11B37) Primes (11A41)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Rowland's sequence
• Binomial Coefficients and the Distribution of the Primes
• A natural prime-generating recurrence
• Estimates of $\theta(x;k,l)$ for large values of $x$
• Zero-Free Regions for Dirichlet L-Functions, and the Least Prime in an Arithmetic Progression
• Primes in arithmetic progressions

This page was built for publication: On the use of the least common multiple to build a prime-generating recurrence