On a diophantine equation of Andrej Dujella

نویسندگان

  • Keith R. Matthews
  • John P. Robertson
  • Jim White
چکیده

We investigate positive solutions (x, y) of the Diophantine equation x2 − (k2 + 1)y2 = k2 that satisfy y < k − 1, where k ≥ 2. It has been conjectured that there is at most one such solution for a given k.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indecomposability of polynomials and related Diophantine equations

We present a new criterion for indecomposability of polynomials over Z. Using the criterion we obtain general finiteness result on polynomial Diophantine equation f(x) = g(y).

متن کامل

Diophantine equations for second order recursive sequences of polynomials

Let B be a nonzero integer. Let define the sequence of polynomials Gn(x) by G0(x) = 0, G1(x) = 1, Gn+1(x) = xGn(x) +BGn−1(x), n ∈ N. We prove that the diophantine equation Gm(x) = Gn(y) for m,n ≥ 3, m 6= n has only finitely many solutions.

متن کامل

Rational Diophantine sextuples with mixed signs

A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them is one less than a perfect square. Recently Gibbs constructed several examples of rational Diophantine sextuples with positive elements. In this note, we construct examples of rational Diophantine sextuples with mixed signs. Indeed, we show that such examples exist for all possible combinatio...

متن کامل

Diophantine quadruples and Fibonacci numbers

A Diophantine m-tuple is a set of m positive integers with the property that product of any two of its distinct elements is one less then a square. In this survey we describe some problems and results concerning Diophantine m-tuples and their connections with Fibonacci numbers.

متن کامل

On the size of Diophantine m-tuples

Let n be a nonzero integer. A set of m positive integers {a1, a2, . . . , am} is said to have the property D(n) if aiaj + n is a perfect square for all 1 ≤ i < j ≤ m. Such a set is called a Diophantine m-tuple (with the property D(n)), or Pn-set of size m. Diophantus found the quadruple {1, 33, 68, 105} with the property D(256). The first Diophantine quadruple with the property D(1), the set {1...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014