On the lcm of the Differences of Eight Primes

DOI10.2307/2008666zbMath0661.10010OpenAlexW4248219951MaRDI QIDQ3809853

François Morain

Publication date: 1989

Full work available at URL: https://doi.org/10.2307/2008666

zbMATH Keywords

complexityalgorithmleast common multiplecomputational number theorydifferences of primesP-admissible

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Primes (11A41)

Cites Work

• Unnamed Item
• Unnamed Item
• Finding a Maximum Clique in an Arbitrary Graph
• On the incompatibility of two conjectures concerning primes; a discussion of the use of computers in attacking a theoretical problem
• The divisor function at consecutive integers

This page was built for publication: On the lcm of the Differences of Eight Primes