Related papers: On Fermat's Last Theorem for odd prime exponents

Let $K$ be a number field and $p$ a prime number $\geq 5$. Let us denote by $\mu_p$ the group of the $p$th roots of unity. We define $p$ to be $K$-regular if $p$ does not divide the class number of the field $K(\mu_p)$. Under the assumption…

Let $p$ be an odd prime number. In this paper, we are concerned with the behaviour of Fermat curves defined over ${\bf Q}$ given by equations $ax^p+by^p+cz^p=0$, with respect to the local-global Hasse principle. It is conjectured that there…

Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities of…

For a prime $p$ and an integer $u$ with $\gcd(u,p)=1$, we define Fermat quotients by the conditions $$ q_p(u) \equiv \frac{u^{p-1} -1}{p} \pmod p, \qquad 0 \le q_p(u) \le p-1. $$ D. R. Heath-Brown has given a bound of exponential sums with…

Let $\alpha,\beta,\gamma\in\mathbb{N}$. We prove that given an $r$-colouring of $\mathbb{F}_p$ with $p$ prime, there are more than $c_{r,\alpha,\beta,\gamma} p^2$ solutions to the equation $x^\alpha+y^\beta=z^\gamma$ with all of $x,y,z$ of…

From some works of P. Furtw\"angler and H.S. Vandiver, we put the basis of a new cyclotomic approach to Fermat's last theorem for p>3 and to a stronger version called SFLT, by introducing governing fields of the form Q(exp(2 i pi/q-1)) for…

Let p, c be distinct odd primes, and l \ge 2 an integer. We find sufficient conditions for the Diophantine equation cy^l=(x^p-1)/(x-1) not to have integer solutions

We present improved algorithms for computing the left factorial residues $!p=0!+1!+...+(p-1)! \!\mod p$. We use these algorithms for the calculation of the residues $!p\!\mod p$, for all primes $p$ up to $2^{40}$. Our results confirm that…

We prove that the equation ${ (x - y)^4 + x^4 + (x + y)^4 = z^n }$ has no integer solutions ${ x, y, z}$ with ${ \gcd(x, y) = 1 }$ for all integers ${ n > 1 }$. We mainly use a modular approach with two Frey ${ \mathbb{Q} }$-curves defined…

The Modular Group provides simple proofs of Fermat's representations: X^2+Y^2 for primes congruent to 1 (mod 4) and by X^2+3Y^2 for primes congruent to 1 (mod 3)

For a fixed integer a>1, we suggest that the probability of nullity of the p-Fermat quotient q(p,a) is much lower than 1/p for any arbitrary large prime number p. For this we use various heuristics, justified by means of numerical…

We consider the generalized Fermat equation (*) $x^2 + y^3 = z^{25}$. Using the known parameterization of the primitive integral solutions to $x^2 + y^3 = z^5$ (due to Edwards), we reduce the solution of (*) to the solution of five specific…

Let $n$ be a positive integer, $p$ be an odd prime and integers $a,b \not= 0$ with $gcd(a,b)=1$, $p \nmid ab$, and $p|(a^n \pm b^n)$, we prove the identity $$\nu_p(a^n \pm b^n)-\nu_p(n)=\nu_p(a^{p-1}-b^{p-1}).$$ An unintended interesting…

In this paper, we gave solutions of the Diophantine equations 16^{x}+p^{y}=z^{2}, 64^{x}+p^{y}=z^{2} where p is an odd prime, n is a positive integer and x,y,z are non-negative integers. Finally we gave a generalization of the Diophantine…

The first case of Fermat's Last Theorem for a prime exponent $p$ can sometimes be proved using the existence of local obstructions. In 1823, Sophie Germain has obtained an important result in this direction by establishing that, if $2p+1$…

We show that Fermat's last theorem and a combinatorial theorem of Schur on monochromatic solutions of $a+b=c$ implies that there exist infinitely many primes. In particular, for small exponents such as $n=3$ or $4$ this gives a new proof of…

We prove that the Diophantine equation (a^2 c x^k - 1)(b^2 c y^k - 1) = (abc z^k - 1)^2 has no solutions in positive integers with x, y, z > 1, k \geq 7 and a^2x^k \neq b^2y^k.

[This is an older version of the paper, which will be updated soon.] In the present paper, we continue our research on the generalized Fermat equation $x^r + y^s = z^t$ with signature $(r, s, t)$, where $r, s, t \ge 2$ are positive integers…

In this work, the author shows a sufficient and necessary condition for an integer of the form $(zn-y^n)/(z-y)$ to be divisible by some perfect $mth$ power $p$, where $p$ is an odd prime and $m$ is a positive integer. A constructive method…

By means of elementary conditions on coefficients, we isolate a large class of Fermat-like Diophantine equations that are not partition regular, the simplest examples being $x^n+y^m=z^k$ with $k\notin\{n,m\}$.