|
The paper gives a computational method for solving Diophantine equations ax^k - by^k = K for certain a, b, and K. The method is based on an effective irrationality measure result for (a/b)^1/k and on the computation of the continued fraction expansion of (a/b)^1/k up to 20,000 partial denomiators. The computation was performed using Mathematica.
|
|