相关论文: An implementation of Runge's method for Diophantin…

In this paper we propose a method of solving a Nonlinear Diophantine Equation by converting it into a System of Diophantine Linear Equations.

We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…

In this short note we present a method of solving this Diophantine equation, method which is different from Ljunggren's, Mordell's, and R.K.Guy's.

Using the Thue-Siegel method, we obtain effective improvements on Liouville's irrationality measure for certain one-parameter families of algebraic numbers, defined by equations of the type $(t-a)Q(t)+P(t)=0$. We apply these to some…

The Diophantine equation (x^n-1)/(x-1)=y^q has four known solutions in integers x, y, q and n with |x|, |y|, q > 1 and n > 2. Whilst we expect that there are, in fact, no more solutions, such a result is well beyond current technology. In…

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…

Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete…

The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…

In this paper we obtain the Lebesgue and Hausdorff measure results for the set of vectors satisfying infinitely many fully non-linear Diophantine inequalities. The set is associated with a class of linear inhomogeneous partial differential…

This paper aims to employ a cluster-theoretic approach to provide a class of Diophantine equations whose solutions can be obtained by starting from initial solutions through mutations. We establish a novel framework bridging cluster theory…

This paper collects polynomial Diophantine equations that are simple to state but apparently difficult to solve.

We consider some variations on the classical method of Runge for effectively determining integral points on certain curves. We first prove a version of Runge's theorem valid for higher-dimensional varieties, generalizing a uniform version…

The paper proposes artificial intelligence technique called hill climbing to find numerical solutions of Diophantine Equations. Such equations are important as they have many applications in fields like public key cryptography, integer…

In this book a multitude of Diophantine equations and their partial or complete solutions are presented. How should we solve, for example, the equation {\eta}({\pi}(x)) = {\pi}({\eta}(x)), where {\eta} is the Smarandache function and {\pi}…

This work determine the entire family of positive integer solutions of the diophantine equation. The solution is described in terms of $\frac{(m-1)(m+n-2)}{2} $ or $\frac{(m-1)(m+n-1)}{2}$ positive parameters depending on $n$ even or odd.…

We develop continuous-stage Runge-Kutta methods based on weighted orthogonal polynomials in this paper. There are two main highlighted merits for developing such methods: Firstly, we do not need to study the tedious solution of…

Here we derive some results on so called quantitative Runge approximation in the case of the time-harmonic Maxwell equations. This provides a Runge approximation having more explicit quantitative information. We additionally derive some…

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

Finding integer solutions to norm form equations is a classical Diophantine problem. Using the units of the associated coefficient ring, we can produce sequences of solutions to these equations. It is known that these solutions can be…

We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower…