arXiv (All)
open access
A Proof of Fraenkel's Conjecture
Fraenkel's conjecture asserts that a partition of the integers into at least three Beatty sequences with distinct moduli has the binary densities $1,2,4,\ldots,2^{m-1}$, normalized by $2^m-1$. We prove the conjecture through a dimension-free intermediate statement: every such partition contains a co
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
- A Proof of the Chen--Raspaud Conjecture#615235
- A Proof of the Chen--Raspaud Conjecture#614268
- Two Infinite Families of Regular Sequences of Power Sums in Three Variables#985339
- A Kernel-Certified Verification of the Erdős-Mollin-Walsh Conjecture below $10^{14}$#1051504
- Strongly Pseudoperfect Numbers#1130910
Record · ID 821597
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