An arbitrary quadratic diophantine equation with two unknowns can be reduced to a Pell-type equation. How can such equations be solved? Recall that the general solution of a linear diophantine equation is a linear function of some parameters. This does not happen with general quadratic diophantine equations. However, as we will see later, in the case of such equations with two unknowns there st...

following result. THEOREM 1. The only (n,m)eZ with n^2 and m5=4 satisfying © = ( 7 ) a r e {n> m)=(2> 4)> (6> 6)> and (21> Our binomial diophantine equation represents an elliptic curve, since it can be rewritten as a quartic polynomial being a square. Indeed, on putting u = 2/i 1 and v = 2m 3, we see at once that Theorem 1 follows from the following result. THEOREM 2. The only (u, v) e Z with ...

In this note, we mainly obtain the equation x2m − yn = z2 have finite positive integer solutions (x, y, z,m, n) satisfying x > y be two consecutive primes. Mathematics Subject Classification: 11A41; 11D41

In this paper we study the Diophantine equation x −6xy +5y = 16Fn−1Fn+1, where (Fn) n≥0 is the Fibonacci sequence and we find a class of such equations having solutions which are determined.

= c for some integers a, b, c with ab 6= 0, has only finitely many integer solutions. Stoll & Tichy proved more generally that if a, b, c ∈ Q and ab 6= 0, then for m > n ≥ 3, the above equation has only finitely many integral solutions x, y. Independently, Rakaczki established a more precise finiteness result on this binomial equation and extended this result to more general equations (see Acta...

If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptions of (a, b, n) satisfying b = a + 1, 2 ≤ a ≤ min{0.3n, 83} and 17 ≤ n ≤ 347. The proof of this result relies on a variety of diophantine approximation techniques including those of rational approximation to hypergeometri...

Let A, B, a, b and c be fixed nonzero integers. We prove several results on the number of solutions to Pillai’s Diophantine equation Aa −Bby = c in positive unknown integers x and y.

In this paper, we study the Diophantine equation x2 + C = 2yn in positive integers x, y with gcd(x, y) = 1, where n ≥ 3 and C is a positive integer. If C ≡ 1 (mod 4) we give a very sharp bound for prime values of the exponent n; our main tool here is the result on existence of primitive divisors in Lehmer sequence due Bilu, Hanrot and Voutier. When C 6≡ 1 (mod 4) we explain how the equation can...