Related papers: A systematic approach to Diophantine equations: op…

Let $p$ and $q$ be distinct primes such that $q+1 | p-1$. In this paper we find all integer solutions $a$, $b$ to the equation $1/a + 1/b = (q+1)/pq$ using only elementary methods.

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.

We estimate the lattice sums arising in the context of the integer point counting in polyhedra.

It is a generalization of Pell's equation $x^2-Dy^2=0$. Here, we show that: if our Diophantine equation has a particular integer solution and $ab$ is not a perfect square, then the equation has an infinite number of solutions; in this case…

The object of this paper is to give a new proof of all the solutions of the Diophantine equation x^2+11^m=y^n; in positive integers x, y with odd m>1 and n>=3.

The paper shows that the asymptotic density of solutions of Diophantine equations or systems of the natural numbers is 0. The author provides estimation methods and estimates number, density and probability of k- tuples $<x_1,...x_k>$ to be…

For K \subseteq C, let B_n(K)={(x_1,...,x_n) \in K^n: for each y_1,...,y_n \in K the conjunction (\forall i \in {1,...,n} (x_i=1 => y_i=1)) AND (\forall i,j,k \in {1,...,n} (x_i+x_j=x_k => y_i+y_j=y_k)) AND (\forall i,j,k \in {1,...,n}…

We present here a large collection of harmonic and quadratic harmonic sums, that can be useful in applied questions, e.g., probabilistic ones. We find closed-form formulae, that we were not able to locate in the literature.

We characterize the biorthogonal polynomials that appear in the theory of coupled random matrices via a Riemann-Hilbert problem. Our Riemann-Hilbert problem is different from the ones that were proposed recently by Ercolani and McLaughlin,…

I consider the Diophantine approximation problem of sup-norm simultaneous rational approximation with common denominator of a pair of irrational numbers, and compute explicitly some pairs with large approximation constant. One of these…

This brief note aims at condensing some results on the 32-point approximate DFT and discussing its arithmetic complexity.

The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for…

In this note, we find all the solutions of the Diophantine equation x^2 +2^a.3^b.11^c=y^n in nonnegative integers a, b, c, x, y, n>= 3 with x and y coprime.

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…

In this paper, we explicitly find all solutions of the title Diophantine equation, using lower bounds for linear forms in logarithms and properties of continued fractions. Further, we use a version of the Baker-Davenport reduction method in…

This paper is a continuation of [1], in which I studied Harvey Friedman's problem of whether the function f(x,y) = x^2 + y^3 satisfies any identities; however, no knowledge of [1] is necessary to understand this paper. We will break the…

We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…

We study some problems in metric Diophantine approximation over local fields of positive characteristic.

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…