On the Diophantine equation nk = ml + d

DOI10.1016/J.JNT.2019.08.007MaRDI QIDQ2009174zbMATH OpenOpenAlexFDO

Authors H. R. Gallegos-Ruiz, N. Katsipis, Maciej Ulas, Szabolcs Tengely

Publication date 27 November 2019

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.11369

zbMATH Keywords

binomial coefficientDiophantine equationelliptic curvegenus two curveinteger points

Mathematics Subject Classification ID

Cubic and quartic Diophantine equations (11D25) Higher degree equations; Fermat's equation (11D41) Elliptic curves over global fields (11G05) [https://duckduckgo.com/?q=MSC%2011G30%20%22Curves+of+arbitrary+genus+or+genus+%28%0D%0Ae+1%29+over+global+fields%22 Curves of arbitrary genus or genus ( e 1) over global fields (11G30)] Linear forms in logarithms; Baker's method (11J86)

Abstract: By finding all integral points on certain elliptic and hyperelliptic curves we completely solve the Diophantine equation $$ for $-3leqdleq3$ and $(k,l)in(2,3),;(2,4),;(2,5),;(2,6),;(2,8),;(3,4),;(3,6),;(4,6),;(4,8).$ Moreover, we present some other observations of computational and theoretical nature concerning the title equation.

Review text

In this paper, the solutions of the Diophantine equation \(\binom{n}{k}=\binom{m}{l} + d\), in positive integers \(n\) and \(m\) are studied. First, suppose that \(p\) is a prime \(> 4\) \((k, l) = (2, 4)\), \(d\in \mathbb{Z}\), 3 is a quadratic non-residue modulo \(p\), and the \(p\)-adic valuation of \(12d + 1\) is odd. Then, it is proved that the congruence \(\binom{n}{k}\equiv\binom{m}{l}+d \pmod p\) has no solution, and so the above Diophantine equation has no solution for \((k, l) = (2, 4)\), and \(d \in \mathbb{Z}\). Next, using elementary methods, all integral solutions of the Diophantine equation, with \(l = k \in \{3, 4, 5\}\), and \(d \in\{1, 2, \ldots , 20\}\) are computed. The cases where \( d \in \{-3, \ldots , 3\}\) and \(n \geq k\), \(m \geq l\) are reduced to the computation of integral points of some elliptic curves, and so, all solutions of the above equation are computed. Finally, all integral solutions of the equation with \(d \in \{-3,\ldots, 3\}\), \(k = 2\), \(l = 5\) are computed, by reduction of this problem to the same problem for some curves of genus 2.

Recommendations

• Elliptic binomial diophantine equations
• Diophantine equations coming from binomial near-collisions
• On the diophantine equation ${n \choose k} = x^l$
• scientific article; zbMATH DE number 4043931
• Combinatorial diophantine equations

Cites work

• A BINOMIAL DIOPHANTINE EQUATION
• An explicit theory of heights for hyperelliptic Jacobians of genus three
• Binomial collisions and near collisions
• Chabauty-Coleman experiments for genus 3 hyperelliptic curves
• Combinatorial diophantine equations
• Computing integral points on elliptic curves
• Computing integral points on genus 2 curves estimating hyperelliptic logarithms
• Elliptic binomial diophantine equations
• Elliptic curves. A computational approach. With an appendix by Attila Pethö
• Elliptic Diophantine equations. A concrete approach via the elliptic logarithm
• Factoring polynomials with rational coefficients
• scientific article; zbMATH DE number 4043931 (Why is no real title available?)
• scientific article; zbMATH DE number 38432 (Why is no real title available?)
• scientific article; zbMATH DE number 3506713 (Why is no real title available?)
• scientific article; zbMATH DE number 920773 (Why is no real title available?)
• scientific article; zbMATH DE number 3278402 (Why is no real title available?)
• scientific article; zbMATH DE number 3278404 (Why is no real title available?)
• Implementing 2-descent for Jacobians of hyperelliptic curves
• Integral points on hyperelliptic curves
• On the height constant for curves of genus two
• On the height constant for curves of genus two, II
• On the integer solutions of \(y(y+1) = x(x+1) (x+2)\)
• S-INTEGRAL POINTS ON HYPERELLIPTIC CURVES
• Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms
• Solving elliptic diophantine equations by estimating linear forms in elliptic logarithms. The case of quartic equations
• The Magma algebra system. I: The user language
• Two-cover descent on hyperelliptic curves
• Решение одной проблемы фигурных чисел

Cited in

(14)

• The Prouhet-Tarry-Escott problem, indecomposability of polynomials and Diophantine equations
• Combinatorial diophantine equations
• A new kind of Diophantine equations
• On the Diophantine equation \({n \choose k_1,\dots,k_s}=x^l\)
• Diophantine equations of matching games. II.
• Balancing with binomial coefficients
• Consecutive binomial coefficients satisfying a quadratic relation
• Combinatorial Diophantine equations - the genus 1 case
• scientific article; zbMATH DE number 4043931 (Why is no real title available?)
• A BINOMIAL DIOPHANTINE EQUATION
• Diophantine equations coming from binomial near-collisions
• The Diophantine equation f(x)=g(y)$f(x)=g(y)$ for polynomials with simple rational roots
• An extensive review of the literature using the Diophantine equations to study fuzzy set theory
• A note on balancing binomial coefficients

Describes a project that uses

Uses Software

• SageMath
• WIN4
• Magma

This page was built for publication: On the Diophantine equation \(\binom{n}{k} = \binom{m}{l} + d\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009174)