A diophantine sum with factorials
Geoffrey B. Campbell, Aleksander Zujev

TL;DR
This paper explores solutions to a Diophantine equation involving factorials, expressing it as a cubic form or sum of binomial coefficients, and relates some solutions to Fermat's Last Theorem.
Contribution
It introduces new solutions to factorial-based Diophantine equations and connects them to higher degree forms and Fermat's Last Theorem.
Findings
Solutions to factorial Diophantine equations as cubic forms
Representation of solutions as sums of binomial coefficients
Connections between solutions and Fermat's Last Theorem
Abstract
We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable Fermat Last Theorem equation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Polynomial and algebraic computation · Commutative Algebra and Its Applications
