Analysis of algorithms for Moser's problems on sums of consecutive primes

DOI10.5281/ZENODO.23018400MaRDI QIDQ7395709zbMATH OpenFDO

Authors Jonathan P. Sorenson, Eleanor Waiss

Publication date 2026

Published in Integers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5281/ZENODO.23018400

Mathematics Subject Classification ID

Elementary number theory (11Axx)

Cites work

• Algorithmic Number Theory
• Algorithms and bounds on the sums of powers of consecutive primes
• Explicit bounds and parallel algorithms for counting multiply gleeful numbers
• scientific article; zbMATH DE number 1643933 (Why is no real title available?)
• scientific article; zbMATH DE number 918133 (Why is no real title available?)
• scientific article; zbMATH DE number 7556161 (Why is no real title available?)
• On the Sum of Consecutive Primes
• Prime sieves using binary quadratic forms
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• Two compact incremental prime sieves
• Unsolved problems in number theory

This page was built for publication: Analysis of algorithms for Moser's problems on sums of consecutive primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7395709)