English
Related papers

Related papers: Thue Equations and Lattices

200 papers

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

We investigate the integer solutions of Diophantine equations related to Lehmer's totient conjecture. We give an algorithm that computes all nontrivial spoof Lehmer factorizations with a fixed number of factors, and enumerate all nontrivial…

Number Theory · Mathematics 2025-11-19 Grant Molnar , Guntas Singh

The purpose of this paper is to study a class of ill-posed differential equations. In some settings, these differential equations exhibit uniqueness but not existence, while in others they exhibit existence but not uniqueness. An example of…

Classical Analysis and ODEs · Mathematics 2017-01-04 Brian Street

In this paper we use matrices, whose entries satisfy certain linear conditions, to obtain composition identities $f(x_i)f(y_i)=f(z_i)$, where $f(x_i)$ is an irreducible form, with integer coefficients, of degree $n$ in $n$ variables ($n$…

Number Theory · Mathematics 2020-05-18 Ajai Choudhry

A Diophantine $m$-tuple with elements in the field $K$ is a set of $m$ non-zero (distinct) elements of $K$ with the property that the product of any two distinct elements is one less than a square in $K$. Let $X: (x^2-1)(y^2-1)(z^2-1)=k^2,$…

Number Theory · Mathematics 2021-08-25 Matija Kazalicki , Bartosz Naskręcki

In this article, we consider the equation x^2+19^{m}=y^n, n>2, m>0. We find the solutions of the title equation for not only 2 \mid m but also 2\notdividesm.

Number Theory · Mathematics 2012-02-03 Bilge Peker , Selin , Cenberci

In this paper we determine possible decompositions of Euler polynomials $E_k(x)$, i.e. possible ways of writing Euler polynomials as a functional composition of polynomials of lower degree. Using this result together with the well-known…

Number Theory · Mathematics 2013-12-16 D. Kreso , Cs. Rakaczki

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 this note we show that for a given irreducible binary quadratic form $f(x,y)$ with integer coefficients, whenever we have $f(x,y) = f(u,v)$ for integers $x,y,u,v$, there exists a rational automorphism of $f$ which sends $(x,y)$ to…

Number Theory · Mathematics 2017-04-19 Stanley Yao Xiao

This paper finds all Lucas numbers which are the sum of two Jacobsthal numbers. It also finds all Jacobsthal numbers which are the sum of two Lucas numbers. In general, we find all non-negative integer solutions $(n, m, k)$ of the two…

Number Theory · Mathematics 2024-10-17 Osama Salah , A. Elsonbaty , Mohammed Abdul Azim Seoud , Mohamed Anwar

The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius…

Number Theory · Mathematics 2026-02-13 Eteri Samsonadze

In this paper we define Diophantine exponents of lattices and investigate some of their properties. We prove transference inequalities and construct some examples with the help of Schmidt's subspace theorem.

Number Theory · Mathematics 2016-06-01 Oleg N. German

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

General Mathematics · Mathematics 2026-05-26 Bogdan Grechuk

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

Author developed a method in the paper, which, unlike the circle method of Hardy and Littlewood (CM), allows you to perform a lower estimate for the number of natural (integer) solutions of algebraic Diophantine equation with integer…

Number Theory · Mathematics 2016-04-28 Victor Volfson

We will be presenting two theorems in this paper. The first theorem, which is a new result, is about the non-existence of integer solutions of the cubic diophantine equation. In the proof of this theorem we have used some known results from…

General Mathematics · Mathematics 2007-05-23 Joseph Amal Nathan

In this paper we completely solve the Diophantine equation $F_n+F_m=2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$, where $F_k$ denotes the $k$-th Fibonacci number. In addition to complex linear forms in logarithms and the Baker-Davenport…

Number Theory · Mathematics 2021-04-27 Ingrid Vukusic , Volker Ziegler

In this paper we introduce a new diophantine equation with prime numbers. Let $[\, \cdot\,]$ be the floor function. We prove that when $1<c<\frac{23}{21}$ and $\theta>1$ is a fixed, then every sufficiently large positive integer $N$ can be…

Number Theory · Mathematics 2021-11-05 S. I. Dimitrov

The existence of sufficiently many finite order meromorphic solutions of a differential equation, or difference equation, or differential-difference equation, appears to be a good indicator of integrability. In this paper, we investigate…

Classical Analysis and ODEs · Mathematics 2018-08-14 Li-Hao Wu , Ran-Ran Zhang , Zhi-Bo Huang

We investigate $f$-Diophantine sets over finite fields via new explicit constructions of families of quasi-random hypergraphs from multivariate polynomials. In particular, our construction not only offers a systematic method for…

Combinatorics · Mathematics 2026-04-20 Seoyoung Kim , Chi Hoi Yip , Semin Yoo
‹ Prev 1 8 9 10 Next ›