On formula to compute primes and the nth prime

From MaRDI portal

Publication:4918961

Jump to:navigation, search

zbMath1279.11005arXiv1202.4687MaRDI QIDQ4918961

Issam Kaddoura, Samih Abdul-Nabi

Publication date: 7 May 2013

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

zbMATH Keywords

congruence Euclidean algorithm prime primality test sieve of Eratosthenes

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Primes (11A41)

Related Items (1)

A dynamic prime number based efficient security mechanism for big sensing data streams

This page was built for publication: On formula to compute primes and the nth prime

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4918961&oldid=19327029"