
TL;DR
This paper investigates a specific binomial coefficient balancing equation, proving that the only integer solution occurs at (14,15) using elliptic logarithm methods.
Contribution
It provides a complete solution to a binomial coefficient balancing problem by applying elliptic logarithm techniques to a Diophantine equation.
Findings
The only solution is (14,15).
The method involves elliptic logarithm bounds.
The problem is solved completely for the given equation.
Abstract
In 2014, T. Komatsu and L. Szalay studied the balancing binomial coefficients. In this paper, we focus on the following Diophantine equation where are integer unknowns. We prove that the only integral solution is . Our method is mainly based on the linear form in elliptic logarithms.
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.
