Two existing algorithms that count representations as sums of consecutive primes are analyzed, giving O(x log x) time with sublinear memory, and run to 10^14, producing the first integer with 14 representations and heuristic yes-answers to Moser's four questions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Analysis of Algorithms for Moser's Problems on Sums of Consecutive Primes
Two existing algorithms that count representations as sums of consecutive primes are analyzed, giving O(x log x) time with sublinear memory, and run to 10^14, producing the first integer with 14 representations and heuristic yes-answers to Moser's four questions.