The difficulty of the local solubility problem for additive equations
The goal of this article is twofold. First, we extend a result of Murty and Saradha (2007) related to the digamma function at rational arguments. Further, we extend another result of the same authors (2008) about the nature of p-adic Euler-Lehmer constants.
We make more accessible a neglected simple continued fraction based algorithm due to Lagrange, for deciding the solubility of in relatively prime integers , where , gcd is not a perfect square. In the case of solubility, solutions with least positive y, from each equivalence class, are also constructed. Our paper is a generalisation of an earlier paper by the author on the equation . As in that paper, we use a lemma on unimodular matrices that gives a much simpler proof than Lagrange’s for...
Recently, Miyazaki and Togbé proved that for any fixed odd integer b ≥ 5 with b ≠ 89, the Diophantine equation has only the solution (x,y,z) = (1,1,1). We give an extension of this result.
It is shown that for a given squarefree positive integer D, the equation of the title has no solutions in integers x > 0, m > 0, n ≥ 3 and y odd, nor unless D ≡ 14 (mod 16) in integers x > 0, m = 0, n ≥ 3, y > 0, provided in each case that n does not divide the class number of the imaginary quadratic field containing √(-2D), except for a small number of (stated) exceptions.
Let , be the sets of all integers and positive integers, respectively. Let be a fixed odd prime. Recently, there have been many papers concerned with solutions of the equation , , , , , , And all solutions of it have been determined for the cases , , and . In this paper, we mainly concentrate on the case , and using certain recent results on exponential diophantine equations including the famous Catalan equation, all solutions of the equation , , , , , , , are determined....