arXiv (All)
open access
Analysis of Algorithms for Moser's Problems on Sums of Consecutive Primes
In his 1963 paper on the sum of consecutive primes, Moser posed four open questions related to $f(n)$, the number of ways an integer $n$ can be written as a sum of consecutive primes. (See also problem C2 from Richard K.~Guy's \textit{Unsolved Problems in Number Theory}.) In this paper, we present a
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Counterexamples to a conjecture of Kamenetsky on OEIS A173419#1076169
- Primes with Restricted-Digit Differences#987858
- Vô Conjecture 17 (VC17)#83726
- An Extension of Polignac’s Conjecture for the Set of Primes with a Gap of 2k#402181
- Distinct Consecutive Products#1011277
Record · ID 1130467
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive