Skip to content
DraconiticResearch
Search Sources API
206,690 studies31 sourcesUpdated 22 min ago
PreprintarXiv licencearXiv

The factorial separation conjecture

Abstract

We propose the Factorial Separation Conjecture (FSC), a strict strengthening of earlier factorial gap conjectures: |n!−mk|>n for all integers n≥8 and m,k≥2. The inequality excludes every displacement up to and including the factorial index. We prove the conjecture unconditionally for exponents divisible by three, for even exponents at least four, and for every exponent at least two when the largest prime divisor of the base is at most n+2. For exponents divisible by five, we prove the finite interval 8≤ n≤1100 and all sufficiently large indices, with an effective but uncomputed threshold. The conclusion for every n≥8 and every exponent divisible by five is proved under the Generalized Riemann Hypothesis (GRH) for a specified family of Dedekind zeta functions. Here GRH asserts that their nontrivial zeros have real part 1/2. The arguments combine valuations, cyclotomic factorizations, cubic reciprocity, character estimates and explicit formulas. All finite comparisons are justified in the text. The general conjecture remains open.

Related

  1. A proof of Karp's conjecture on the zeros of Toeplitz determinants of rising factorial series
    Henry Zweiman
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  2. Separation for Schrödinger operators. A counterexample to Simon's conjecture
    M. A. Perelmuter
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  3. Hedetniemi's conjecture for Shannon OR-capacity: counterexamples and asymptotic separation
    Julius A. Zeiss
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Digital Consequences of Legendre’s Formula for Factorial Valuations
    Armend Sh. Shabani
    Discrete Mathematics LettersPeer-reviewedCC BYFull textAlgebra & number theoryDOAJ
  5. Log Sarkisov Program for strongly ℚ-factorial compact Kähler threefolds
    Swapnajit Das, Roktim Mascharak
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
BibTeX
@misc{krasniqi2026factorial,
  title = {{The factorial separation conjecture}},
  author = {Valmir Krasniqi},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.25661},
  eprint = {2610.25661},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.25661},
}
RIS
TY  - UNPB
TI  - The factorial separation conjecture
AU  - Valmir Krasniqi
PY  - 2026
DA  - 2026/10/19
PB  - arXiv
DO  - 10.48550/arxiv.2610.25661
UR  - https://arxiv.org/abs/2610.25661
AB  - We propose the Factorial Separation Conjecture (FSC), a strict strengthening of earlier factorial gap conjectures: |n!−m^k|>n for all integers n≥8 and m,k≥2. The inequality excludes every displacement up to and including the factorial index. We prove the conjecture unconditionally for exponents divisible by three, for even exponents at least four, and for every exponent at least two when the largest prime divisor of the base is at most n+2. For exponents divisible by five, we prove the finite interval 8≤ n≤1100 and all sufficiently large indices, with an effective but uncomputed threshold. The conclusion for every n≥8 and every exponent divisible by five is proved under the Generalized Riemann Hypothesis (GRH) for a specified family of Dedekind zeta functions. Here GRH asserts that their nontrivial zeros have real part 1/2. The arguments combine valuations, cyclotomic factorizations, cubic reciprocity, character estimates and explicit formulas. All finite comparisons are justified in the text. The general conjecture remains open.
ER  -