Related papers: A New Generalization of Fermat's Last Theorem

In this paper, we prove that the only primitive solutions of the equation $a^2+3b^6=c^n$ for $n\geq 3$ are $(a,b,c,n)=(\pm 47,\pm 2,\pm 7,4)$. Our proof is based on the modularity of Galois representations of $\mathbb Q$-curves and the work…

This paper investigates the exponential Diophantine equation of the form $a^x+b=c^y$, where $a, b, c$ are given positive integers with $a,c \ge 2$, and $x,y$ are positive integer unknowns. We define this form as a "Type-I transcendental…

We prove that there is no non-trivial integral positive solution to the generalized Fermat equation.

In a 2011 paper published in the journal "Asian Journal of Algebra"(see reference[1]), the authors consider, among other equations,the diophantine equations 2xy=n(x+y) and 3xy=n(x+y). For the first equation, with n being an odd positive…

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…

An alternative form of Fermats equation[1] is proposed. It represents a portion of the identity that includes three terms of Fermats original equation. This alternative form permits an elementary and compact proof of the first case of…

In 2000, Darmon described a program to study the generalized Fermat equation using modularity of abelian varieties of $\mathrm{GL}_2$-type over totally real fields. The original approach was based on hard open conjectures, which have made…

Suppose that $x$ is odd, $n\geq7$ and $p\notin\{2,5\}$ are primes. In this paper, we prove that the Diophantine equations $x^{2}\pm5^{\alpha}p^{n}=y^{n}$ have no solutions in positive integers $\alpha,x,y$ with $gcd(x,y)=1$.

In this paper, we investigate the Diophantine equation \[ (2^k - 1)(3^k - 1) = x^n \] and prove that it has no solutions in positive integers $k, x, n > 2$.

Let C : y^2=f(x) be a hyperelliptic curve defined over the rationals. Let K be a number field and suppose f factors over K as a product of irreducible polynomials f=f_1 f_2...f_r. We shall define a "Selmer set" corresponding to this…

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.

In this note we will analyze a diophantine equation raised by Michael Bennett in [1] that is pivotal in establishing that powers of five has few digits in its ternary expansion. We will show that the Diophantine equation…

The objective of the paper is to determine the complete solutions for the Diophantine equation $x^2 + 3^{\alpha}113^{\beta} = y^{\mathfrak{n}}$ in positive integers $x$ and $y$ (where $x, y \geq 1$), non-negative exponents $\alpha$ and…

Let $K = \mathbb{F}_p(z_1, \ldots, z_r)$ be a finitely generated field over $\mathbb{F}_p$. In this article we study the generalized Catalan equation $ax^m + by^n = 1$ in $x, y \in K$ and integers $m, n > 1$ coprime with $p$. Our main…

In this note we consider the title Diophantine equation from both theoretical as well as experimental point of view. In particular, we prove that for $k=4, 6$ and each choice of the signs our equation has infinitely many co-prime positive…

In this paper, we consider the Diophantine equation $\lambda_1U_{n_1}+\ldots+\lambda_kU_{n_k}=wp_1^{z_1} \cdots p_s^{z_s},$ where $\{U_n\}_{n\geq 0}$ is a fixed non-degenerate linear recurrence sequence of order greater than or equal to 2;…

We are interested in solving the congruences $f^3+g^3+1\equiv 0\pmod{fg}$ and $f^4-4g^2+4\equiv 0\pmod{fg}$ in polynomials $f, g$ with rational coefficients. Moreover, we present results of computations of all integer points on certain one…

Let $p$ be a prime number with $p>3$, $p\equiv 3\pmod{4}$ and let $n$ be a positive integer. In this paper, we prove that the Diophantine equation $(5pn^{2}-1)^{x}+(p(p-5)n^{2}+1)^{y}=(pn)^{z}$ has only the positive integer solution…

Let $k,l\geq2$ be fixed integers. In this paper, firstly, we prove that all solutions of the equation $(x+1)^{k}+(x+2)^{k}+...+(lx)^{k}=y^{n}$ in integers $x,y,n$ with $x,y\geq1, n\geq2$ satisfy $n<C_{1}$ where $C_{1}=C_{1}(l,k)$ is an…

We propose conjectural generalizations of the Fermat-Catalan conjecture, the Tijdeman-Zagier conjecture, and of the Fermat Last Theorem, in which powers are replaced by products of integers. We also formulate a new explicit version of the…