arXiv (All)
open access
Unit fractions with semiprime denominators: an elementary proof of Erdős Problem #306
We give an elementary proof that every positive rational number $a/b$ with $b$ squarefree is a finite sum of distinct unit fractions $1/n$, where each $n$ is a product of two distinct primes (Erdős Problem #306). After a reduction to small targets, we take a single complete bipartite graph between t
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
- Rationally determinable conditions#756685
- On the factorization of squarefree integers#490249
- On the positivity of truncated pentagonal number series and some conjectures of Merca#1061373
- Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$#31204
- Proof of Almkvist's conjecture on the unimodality of partition polynomials#1049514
Record · ID 1116471
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