arXiv (All)
open access
The factorial separation conjecture
We propose the Factorial Separation Conjecture (FSC), a strict strengthening of earlier factorial gap conjectures: \[ |n!-m^k|>n \] for all integers $n\ge8$ and $m,k\ge2$. The inequality excludes every displacement up to and including the factorial index. We prove the conjecture unconditionally for
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 Fraenkel's Conjecture#821597
- A proof of the strong Erdős--Frankl--Füredi cover-free conjecture#1389388
- Beyond Liu's 0.382709 threshold for the union-closed sets conjecture#1186609
- Sharp Edge-Edit Bounds at Every Level for Leaky Positive Semidefinite Forcing#1037487
- A linear bound for Fujita's freeness conjecture#1070485
Record · ID 1400483
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