Related papers: Fermat's Last Theorem, Solution Sets v6

In this paper we present an elementary proof for a special case of Fermat's last theorem for specific category of a, b and c. In fact, we assume that $n$ is prime and $4\rvert (n+1),$ then for $a,b$ and $c$ that $ n\nmid abc$ the equation…

In this paper, we study the integer solutions of a family of Fermat-type equations of signature $(2, 2n, n)$, $Cx^2 + q^ky^{2n} = z^n$. We provide an algorithmically testable set of conditions which, if satisfied, imply the existence of a…

Fermat's Last theorem (FLT) famously states that the equation $x^n+y^n=z^n$ has no solution in positive integers $x, y, z$ for any integer exponent $n>2$. But does this theorem have a quantitative version? Upon initial investigation we…

Fermat's statement is equivalent to say that if $x$, $y$, $z$, $n$ are integers and $n>2$, then $z^{n}\gtrless x^{n}+y^{n}$. This is proved with the aid of numbers $\lambda $'s, of the form $\lambda =z/\rho $, with $1<\rho<z$, named…

We show that under the assumption of a 24-term version of Fermat's Last Theorem, there exists an absolute constant c > 0 such that if S is a set of n > n_0 positive integers satisfying |S.S| < n^(1+c), then the sumset S.S satisfies |S+S| >>…

In this paper, we consider some hybrid Diophantine equations of addition and multiplication. We first improve a result on new Hilbert-Waring problem. Then we consider the equation \begin{equation} \begin{cases} A+B=C ABC=D^n \end{cases}…

We discuss the equation $a^p + 2^\a b^p + c^p =0$ in which $a$, $b$, and $c$ are non-zero relatively prime integers, $p$ is an odd prime number, and $\a$ is a positive integer. The technique used to prove Fermat's Last Theorem shows that…

Let $K$ be a totally real field. By the asymptotic Fermat's Last Theorem over $K$ we mean the statement that there is a constant $B_K$ such that for prime exponents $p>B_K$ the only solutions to the Fermat equation $a^p + b^p + c^p = 0$…

The aim of this study is to investigate the precise form of finite-order entire solutions to the following system of Fermat-type partial differential-difference equations: \beas \begin{cases} \left(\frac{\partial f_1\left(z_1, z_2, \ldots,…

First, we consider the equation $ax^2 - by^2 + c = 0$, with $a,b \in N*$ and $c \in Z*$, which is a generalization of Pell's equation. Here, we show that: if this equation has an integer solution and $ab$ is not a perfect square, then it…

For any fixed coprime positive integers $a,b$ and $c$ with $\min\{a,b,c\}>1$, we prove that the equation $a^x+b^y=c^z$ has at most two solutions in positive integers $x,y$ and $z$, except for one specific case which exactly gives three…

This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive…

Assume that $n$ is a positive integer, $p_{j}$ ($j=1,2, \cdots, 6)$ are polynomials, $p$ is an irreducible polynomial, and $f$ is an entire function on $\mathbb{C}^{n}.$ Let $ L(f)=\sum_{j=1}^s q_{t_j}f_{z_{t_j}}$ and…

By studying the n-dimensional cube, the author finds a new way, and use it to proves that the indefinite equation $x^n+y^n=z^n(n=>3)$ has no any solutions of positive integers.

Within the scope of elementary number theory, we prove that, as the main result, if $1 \leq x < y < z$ are integers such that at least one of $y, z, x+y$ is prime then $x^{n}+y^{n} \neq z^{n}$ for every odd integer $n \geq 3$. This result…

Assuming a deep but standard conjecture in the Langlands programme, we prove Fermat's Last Theorem over $\mathbb Q(i)$. Under the same assumption, we also prove that, for all prime exponents $p \geq 5$, Fermat's equation $a^p+b^p+c^p=0$…

The primary aim of this paper is to study the generalized Fermat equation \[ x^2+y^{2n} = z^{3p} \] in coprime integers $x$, $y$, and $z$, where $n \geq 2$ and $p$ is a fixed prime. Using modularity results over totally real fields and the…

The equation $f^n+g^n=1$, $n\in\mathbb{N}$ can be regarded as the Fermat Diophantine equation over the function field. In this paper we study the characterization of entire solutions of some system of Fermat type functional equations by…

Let $a, b, c,$ and $n$ be integers, with $a$ nonzero and $n$ at least two. Necessary and sufficient conditions on these parameters are derived which guarantee that all solutions of the congruence \[ ax^2+bx+c \equiv 0\ \textrm{mod}\ n \]…

The divisibility restrictions in the famous equation a n+bn=cn in Fermat Last Theorem (FLT, 1637) is analyzed how it selects out many triples to be Fermat triple (i.e. solutions) if n greater than 2, decreasing the cardinality of Fermat…