English
Related papers

Related papers: Diophantine equations in separated variables and p…

200 papers

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. If Matiyasevich's conjecture on finite-fold Diophantine representations is true, then for every computable function f:N->N there is a positive integer m(f) such that for…

Logic · Mathematics 2014-10-21 Apoloniusz Tyszka

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,…

Number Theory · Mathematics 2011-08-02 J. C. Lagarias

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

The main idea of this article is simply calculating integer functions in module. The algebraic in the integer modules is studied in completely new style. By a careful construction, a result is proven that two finite numbers is with unequal…

General Mathematics · Mathematics 2021-01-08 Sheng-Ping Wu

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…

Number Theory · Mathematics 2010-03-17 Michael Stoll

In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y. Bilu, G. Hanrot and P. M. Voutier, we first give an explicit formula for all positive integer solutions of the Diophantine equation…

Number Theory · Mathematics 2021-08-11 Maohua Le , Gökhan Soydan

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

Number Theory · Mathematics 2024-01-24 Clemens Fuchs , Vincenzo Mantova , Umberto Zannier

It is proved that a differentiable with respect to each variable function $f:\mathbb R^2\to\mathbb R$ is a solution of the equation $ \frac{\partial u}{\partial x} + \frac{\partial u}{\partial y}=0$ if and only if there exists a function…

General Topology · Mathematics 2015-12-25 V. K. Maslyuchenko , V. V. Mykhaylyuk

Recent developments in the theory and application of the Hardy-Littlewood method are discussed, concentrating on aspects associated with diagonal diophantine problems. Recent efficient differencing methods for estimating mean values of…

Number Theory · Mathematics 2007-05-23 Trevor D. Wooley

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…

Number Theory · Mathematics 2021-11-18 Elisa Bellah

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.

Number Theory · Mathematics 2012-01-04 Ismail Naci Cangul , Musa Demirci , Ilker Inam , Florian Luca , Gokhan Soydan

This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…

Functional Analysis · Mathematics 2025-03-03 Melvyn B. Nathanson , David A. Ross

Let A(n) be a $k\times s$ matrix and $m(n)$ be a $k$ dimensional vector, where all entries of A(n) and $m(n)$ are integer-valued polynomials in $n$. Suppose that $$t(m(n)|A(n))=#\{x\in\mathbb{Z}_{+}^{s}\mid A(n)x=m(n)\}$$ is finite for each…

Combinatorics · Mathematics 2007-10-02 Sheng Chen , Nan Li

Motivated by the recent result of Farhi we show that for each $n\equiv \pm 1\pmod{6}$ the title Diophantine equation has at least two solutions in integers. As a consequence, we get that each (even) perfect number is a sum of three cubes of…

Number Theory · Mathematics 2017-05-03 Maciej Ulas

This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…

Number Theory · Mathematics 2021-08-02 Constantinos Poulias

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. There is an algorithm that for every computable function f:N->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any integer…

Logic · Mathematics 2014-10-21 Apoloniusz Tyszka

A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Such Diophantine sets have been used to construct high rank elliptic curves.…

Number Theory · Mathematics 2007-05-23 Philip Gibbs

Assuming a certain form of resolution of singularities, we prove a general existential Ax-Kochen/Ershov principle for tamely ramified fields in all characteristics. This specializes to well-known results in residue characteristic $0$ and…

Algebraic Geometry · Mathematics 2022-10-17 Konstantinos Kartas

Let $\{a_n\}_{n\in\mathbb{N}}$, $\{b_n\}_{n\in \mathbb{N}}$ be two infinite subsets of positive integers and $\psi:\mathbb{N}\to \mathbb{R}_{>0}$ be a positive function. We completely determine the Hausdorff dimensions of the set of all…

Number Theory · Mathematics 2024-09-30 Bing Li , Ruofan Li , Yufeng Wu

According to Skolem's conjecture, if an exponential Diophantine equation is not solvable, then it is not solvable modulo an appropriately chosen modulus. Besides several concrete equations, the conjecture has only been proved for rather…

Number Theory · Mathematics 2021-05-04 A. Bérczes , L. Hajdu , R. Tijdeman