A RECURSIVE FORMULA CONCERNING THE GREATEST PRIME NUMBER LESS THAN OR EQUAL TO AN ODD NUMBER n

DOI10.17654/NT051010113zbMath1499.11026WikidataQ114049247 ScholiaQ114049247MaRDI QIDQ5074029

Danilo A. García Hernández, Mario Mendoza Villalba

Publication date: 6 May 2022

Published in: JP Journal of Algebra, Number Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

prime numbersrecurrence formulaprimality test

Mathematics Subject Classification ID

Primes (11A41) Primality (11Y11)

Cites Work

• Unnamed Item
• Unnamed Item
• Riemann's hypothesis and tests for primality
• Miller's primality test
• Approximate formulas for some functions of prime numbers
• Implementation of a new primality test
• The number of primes in a short interval.
• Prime Numbers and Brownian Motion
• On Formulae for the Nth Prime Number
• Fast Method for Computing the Number of Primes Less than a Given Limit
• On the Exact Number of Primes Below a Given Limit

This page was built for publication: A RECURSIVE FORMULA CONCERNING THE GREATEST PRIME NUMBER LESS THAN OR EQUAL TO AN ODD NUMBER n