English
Related papers

Related papers: A solution to a problem and the Diophantine equati…

200 papers

Using the modular method, we study solutions to the Diophantine equation $$Aa^p+Bb^p=Cc^2$$ over number fields. We first prove an asymptotic result for general number fields satisfying an appropriate $S$-unit condition by assuming some…

Number Theory · Mathematics 2026-02-24 Begum Gulsah Cakti , Erman Isik , Yasemin Kara , Ekin Ozman

Let $p$ be a prime integer, $\mathbb{Z}_p$ the finite field of order $p$ and $\mathbb{Z}^{*}_{p}$ is its multiplicative cyclic group. We consider the Diophantine equation $x^n + y^n = z^n$ with $1 \leq n \leq \frac{p - 1}{2}$. Our main aim…

Number Theory · Mathematics 2020-01-10 Silvia R. Valdes , Yelena Shvets

By considering the norm of elements in the ring of integers in $\mathbb{Q}(\sqrt{-a})$, we give an algebraic approach to count the number of integral solutions of diophantine equations of the form $x^2+ay^2=n$ where $a$ is a Heegner number…

Number Theory · Mathematics 2022-08-05 Thanathat Dechakulkamjorn , Nithi Rungtanapirom

The Diophantine equation $A^4+hB^4=C^4+hD^4$, where $h$ is a fixed arbitrary positive integer, has been investigated by some authors. Currently, by computer search, the integer solutions of this equation are known for all positive integer…

Number Theory · Mathematics 2017-02-23 Farzali Izadi , Mehdi Baghalagdam

Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we show that for a fixed integer $y$ there exists at most one integer exponent $a>0$ such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ in positive…

Number Theory · Mathematics 2021-03-29 Volker Ziegler

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we look at the exponential Diophantine equation $L_n-2^x3^y=c$, for $n,x,y\in \mathbb{Z}_{\ge0}$. We treat the cases $c\in -\mathbb{N}$, $c=0$ and $c\in \mathbb{N}$…

Number Theory · Mathematics 2024-01-15 Herbert Batte , Mahadi Ddamulira , Juma Kasozi , Florian Luca

Given odd, coprime integers $a$, $b$ ($a>0$), we consider the Diophantine equation $ax^2+b^{2l}=4y^n$, $x, y\in\Bbb Z$, $l \in \Bbb N$, $n$ odd prime, $\gcd(x,y)=1$. We completely solve the above Diophantine equation for…

Number Theory · Mathematics 2020-01-15 Andrzej Dąbrowski , Nursena Günhan , Gökhan Soydan

Necessary and sufficient conditions for the existence of an integer solution of the diophantine equation $m/n=1/x(\lambda)+1/y(\lambda)+1/z(\lambda)$ with $n=b+a\lambda$ are explicitly given for a,b coprime and a not a multiple of m . The…

General Mathematics · Mathematics 2024-04-03 Bernd R. Schuh

Suppose that $n$ is a positive integer. In this paper, we show that the exponential Diophantine equation $$(n-1)^{x}+(n+2)^{y}=n^{z},\ n\geq 2,\ xyz\neq 0$$ has only the positive integer solutions $(n,x,y,z)=(3,2,1,2), (3,1,2,3)$. The main…

Number Theory · Mathematics 2020-03-31 Hairong Bai , Elif Kızıldere , Gökhan Soydan , Pingzhi Yuan

Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences. In particular, we provide an integer-coefficient…

Number Theory · Mathematics 2024-06-11 Robert Dougherty-Bliss , Charles Kenney , Doron Zeilberger

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

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

Number Theory · Mathematics 2015-12-10 Maciej Gawron

The beautiful quartic Diophantine equation $A^4+hB^4=C^4+hD^4$, where $h$ is a fixed arbitrary positive integer, has been studied by some mathematicians for many years. Although Choudhry, Gerardin and Piezas presented solutions of this…

Number Theory · Mathematics 2017-01-11 Farzali Izadi , Mehdi Baghalagdam

We consider the simultaneous Pell equations $$x^2 - ay^2 = 1, \qquad z^2 - bx^2 = 1,$$ where $a > b\geq 2$ are positive integers. We describe a procedure which, for any fixed $b$, either confirms that the simultaneous Pell equations have at…

Number Theory · Mathematics 2024-06-11 Tobias Hilgart , Volker Ziegler

We discuss properties of diophantine solutions of the Pythagoras equation, $a^2+b^2=c^2$, where the three numbers have no common factor. Some of the highlights are: (1) All triplets for which $c$ (called the `peak') is non-prime can be…

General Mathematics · Mathematics 2023-06-23 Palash B. Pal

In this paper, the elliptic curves theory is used for solving the Diophantine equations $\sum_{i=1}^n a_ix_{i} ^6+\sum_{i=1}^m b_iy_{i} ^3= \sum_{i=1}^na_iX_{i}^6\pm\sum_{i=1}^m b_iY_{i} ^3$, where $n$, $m$ $\geq 1$ and $a_i$, $b_i$, are…

Number Theory · Mathematics 2017-01-11 Farzali Izadi , Mehdi Baghalagdam

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

Number Theory · Mathematics 2014-10-21 Apoloniusz Tyszka

Consider the diophantine equation $(3^{x_1}-1)(3^{x_2}-1)=(5^{y_1}-1)(5^{y_2}-1)$ in positive integers $x_1\le x_2$, and $y_1\le y_2$. Each side of the equation is a product of two terms of a given binary recurrence, respectively. In this…

Number Theory · Mathematics 2021-04-01 Kálmán Liptai , László Németh , Gökhan Soydan , László Szalay

Let $a$ and $b$ be two distinct fixed positive integers such that $\min \{a,b\}>1.$ First, we correct an oversight from \cite{X-Z}. Then, we show that the equation in the title with $b \equiv 3 \pmod 8$, $b$ prime and $a$ even has no…

Number Theory · Mathematics 2025-04-22 Armand Noubissie , Alain Togbe , Zhongfeng Zhang

In this paper, we solve the simultaneous Diophantine equations(SDE) x_1^u+...+x_n^u=k(y_1^u+...+y_{n/k}); u=1,3, where n >3, and k< n, is a divisor of n , and obtain nontrivial parametric solution for them. Furthermore we present a method…

Number Theory · Mathematics 2017-05-15 Mehdi Baghalaghdam , Farzali Izadi