On the Diophantine equations \(\binom n2=cx^l\) and \(\binom n3=cx^l\).
type: Item
instance of: scholarly article
title: On the Diophantine equations \(\binom n2=cx^l\) and \(\binom n3=cx^l\).
zbMATH Open document ID: 1040.11016
author: Nobuhiro Terai
published in: Tokyo Journal of Mathematics
publication date: 2004-02-19T00:00:00Z
review text: The author gives upper bounds for the solution \(l\) of the equation \({n\choose 2}= cx^l\) and \({n\choose 3}= cx^l\), where \(n\), \(c\), \(l\) are nonzero integers, by using results concerning the equation \(ax^l- by^l= c\) with \(a\), \(b\), \(c\) nonzero integers. These solutions are also determined in some special cases.
reviewed by: Kálmán Liptai
Mathematics Subject Classification ID: 11D61
Mathematics Subject Classification ID: 11D59
zbMATH DE Number: 1930960
zbMATH Keywords: Thue equations
zbMATH Keywords: elliptic curves
describes a project that uses: SIMATH
describes a project that uses: KANT/KASH
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.3836/tjm/1244208849
OpenAlex ID: W2083063334
cites work: Rational approximation to algebraic numbers of small height: The Diophantine equation \(|ax^n-by^n|=1\)
cites work: On the Diophantine equation |𝑎𝑥ⁿ-𝑏𝑦ⁿ|=1
cites work: Q4366731
cites work: Note on the Product of Consecutive Integers (II)
cites work: On a Diophantine Equation
cites work: Q5558015
cites work: On the diophantine equation ${n \choose k} = x^l$
cites work: On the diophantine equation $n(n+1)...(n+k-1) = bx^l$
cites work: KANT V4
cites work: Q3346401
cites work: Q5781775
cites work: Q5812287
cites work: A note on the equation $ax^n - by^n = c$
cites work: On the equation $a^p + 2^α b^p + c^p = 0$
cites work: Q4001553
cites work: Catalan's Conjecture
cites work: Q3973403
cites work: Q3348428
cites work: Q4101902
cites work: On a diophantine equation of Erdős
cites work: A classical Diophantine problem and modular forms of weight \(3/2\)
DOI: 10.3836/TJM/1244208849
description: scientific article; zbMATH DE number 1930960