English
Related papers

Related papers: The Diophantine problem for systems of algebraic e…

200 papers

We obtain an essentially optimal estimate for the moment of order 32/3 of the exponential sum having argument $\alpha x^3+\beta x^2$. Subject to modest local solubility hypotheses, we thereby establish that pairs of diagonal Diophantine…

Number Theory · Mathematics 2023-05-10 Trevor D. Wooley

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

Group Theory · Mathematics 2020-03-25 Albert Garreta , Alexei Miasnikov , Denis Ovchinnikov

We consider a variety of Euler's conjecture, i.e., whether the Diophantine system \[\begin{cases} n=a_{1}+a_{2}+\cdots+a_{s-1}, a_{1}a_{2}\cdots a_{s-1}(a_{1}+a_{2}+\cdots+a_{s-1})=b^{s} \end{cases}\] has solutions…

Number Theory · Mathematics 2013-10-01 Tianxin Cai , Yong Zhang

Let f(1)=1, and let f(n+1)=2^{2^{f(n)}} for every positive integer n. We conjecture that if a system S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} \cup {x_i+1=x_k: i,k \in {1,...,n}} has only finitely many solutions in non-negative…

Number Theory · Mathematics 2018-08-20 Apoloniusz Tyszka

In [1] it is shown that the Diophantine equation $(k!)^n+k^n=(n!)^k+n^k$ only has the trivial solution $n=k$, and $(k!)^n-k^n=(n!)^k-n^k$ only has the solutions $n=k$, $(n, k)=(1, 2),$ and $(2, 1)$. In this article we find all solutions of…

Number Theory · Mathematics 2021-05-25 Addea Gupta

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…

Number Theory · Mathematics 2013-12-17 Michael A. Bennett , Aaron Levin

Recently, the authors showed that for every irrational number $\alpha$, there exist infinitely many positive integers $n$ represented by any given positive definite binary quadratic form $Q$, satisfying $||\alpha n||<n^{-(1/2-\varepsilon)}$…

Number Theory · Mathematics 2026-02-04 Stephan Baier , Habibur Rahaman

An important unsolved problem in Diophantine number theory is to establish a general method to effectively find all solutions to any given $S$-unit equation with at least four terms. Although there are many works contributing to this…

Number Theory · Mathematics 2025-03-04 Takafumi Miyazaki

The paper presents a new generalized integer orthogonal transformation which consists of a well known orthogonal transform followed by stretching the basis vectors maintaining the asymptotic behavior of the number of integer solutions for…

Number Theory · Mathematics 2017-04-10 Victor Volfson

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…

Logic · Mathematics 2016-10-11 Emil Jeřábek

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

Logic · Mathematics 2012-04-09 Apoloniusz Tyszka

Let k => 1, m => 1 be small fixed integers, gcd(k, m) = 1. This note develops some techniques for proving the existence of infinitely many primes solutions x = p, and y = q of the linear Diophantine equation y = mx + k.

General Mathematics · Mathematics 2014-04-04 N. A. Carella

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 formulate an exponential Diophantine equation, which is is some sense one order higher that Fermat's Last Theorem. We also give three examples of solutions to this exponential Diophantine equation and formulate a conjecture.

Number Theory · Mathematics 2016-11-24 Ivan Horozov

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

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…

Number Theory · Mathematics 2019-02-20 Michael A. Bennett , Amir Ghadermarzi

We prove that Hilbert's Tenth Problem for a ring of integers in a number field K has a negative answer if K satisfies two arithmetical conditions (existence of a so-called division-ample set of integers and of an elliptic curve of rank one…

Number Theory · Mathematics 2007-05-23 Gunther Cornelissen , Thanases Pheidas , Karim Zahidi

In this paper, we study the existence of a solution for a class of Dirichlet problems with a singularity and a convection term. Precisely, we consider the existence of a positive solution to the Dirichlet problem $$-\Delta_p u =…

Analysis of PDEs · Mathematics 2024-09-20 Anderson L. A. de Araujo , Hamilton P. Bueno , Kamila F. L. Madalena

We are motivated by a result of Alzer and Luca who presented all the integer solutions to the relations $(k!)^n-k^n=(n!)^k-n^k$ and $(k!)^n+k^n=(n!)^k+n^k$. We modify the equations by considering the double factorial instead and present all…

Number Theory · Mathematics 2025-10-29 Saša Novaković

In this paper, we consider the exponential Diophantine equation \( (2^k-1)(b^k-1)=y^q \) with $k\ge 2$, odd integer $b$ and an odd prime exponent $q$ and obtain effective upper bounds for $q$ in terms of $b$. In particular, we show that…

Number Theory · Mathematics 2026-04-09 Chang Liu , Bo He
‹ Prev 1 3 4 5 6 7 10 Next ›