Related papers: How to Solve a Diophantine Equation
For any sufficiently strong theory of arithmetic, the set of Diophantine equations provably unsolvable in the theory is algorithmically undecidable, as a consequence of the MRDP theorem. In contrast, we show decidability of Diophantine…
We investigate the number of integer solutions to a multiplicative Diophantine approximation problem and show that the associated counting function converges in distribution to a normal law. Our approach relies on the analysis of…
Pascal's triangle is widely used as a pedagogical tool to explain the "first-order" multiplet patterns that arise in the spectra of $I_N S$ coupled spin-1/2 systems in magnetic resonance. Various other combinatorial structures, which may be…
In this paper, we consider the problem of counting Diophantine inequalities with multiple natural constraints. We prove a very general result in this setting using dynamical techniques. More precisely, we consider the joint asymptotic…
This is an expository lecture on the subject of the title delivered at the Park-IAS mathematical institute in Princeton (July, 2000).
We prove a refined version of Markov's theorem in Diophantine approximation. More precisely, we characterize completely the set of irrationals $x$ such that $\left|x-\frac{p}{q}\right|<\frac{1}{3q^2}$ has only finitely many rational…
Let $u_n$ be a fixed non-degenerate binary recurrence sequence with positive discriminant, $w$ a fixed non-zero integer and $p_1,p_2,\dots,p_s$ fixed, distinct prime numbers. In this paper we consider the Diophantine equation $u_n+u_m=w…
This article introduces a pedagogical method for {\it solving combinatorial problems} that frequently involve structures that are unfamiliar or less familiar. Indeed, an indirect method has been proposed in order to evade any possible…
We solve a family of quadratic Diophantine equations associated to a simple kind of games. We show that the ternary case, in many ways, is the most interesting and the least arbitrary member of the family.
We give a necessary condition for the existence of solutions of the Diophantine equation $p=x^{q}+ry^{q},$ with $p$, $q$, $r$ distinct odd prime natural numbers.
In this paper, elliptic curves theory is used for solving the Diophantine equations X^3+Y^3+Z^3+aU^k=a_0U_0^{t_0}+...+a_nU_n^{t_n}, k=3,4 where n, ti are natural numbers and a, a_i are fixed arbitrary rational numbers. We try to transform…
This paper is concerned with the diophantine equation $\sum_{i=1}^na_ix_i^4= \sum_{i=1}^na_iy_i^4$ where $n \geq 3$ and $a_i,\,i=1,\,2,\,\ldots,\,n$, are arbitrary integers. While a method of obtaining numerical solutions of such an…
Approximating periodic solutions to the coupled Duffing equations amounts to solving a system of polynomial equations. The number of complex solutions measures the algebraic complexity of this approximation problem. Using the theory of…
Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…
Given two relatively prime numbers $a$ and $b$, it is known that exactly one of the two Diophantine equations has a nonnegative integral solution $(x,y)$: $$ ax + by \ =\ \frac{(a-1)(b-1)}{2}\quad \mbox{ and }\quad 1 + ax + by \ =\…
The author showed that any homogeneous algebraic Diophantine equation of the second order can be converted to a diagonal form using an integer non-orthogonal transformation maintaining asymptotic behavior of the number of its integer…
Some variants of the numerical Picard iterations method are presented to solve an IVP for an ordinary differential system. The term numerical emphasizes that a numerical solution is computed. The method consists in replacing the right hand…
Binary quadratic Diophantine equations are of interest from the viewpoint of computational complexity theory. They contain as special cases many examples of natural problems apparantly occupying intermediate stages in the P-NP hierarchy,…
The heights of iterates of the discrete Painleve equations over number fields appear to grow no faster than polynomials while the heights of generic solutions of non-integrable discrete equations grow exponentially. This gives rise to a…
In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where…