On the Diophantine equations \(\binom n2=cx^l\) and \(\binom n3=cx^l\).
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.
scientific article; zbMATH DE number 1930960