Related papers: On Fermat curves modulo a finite number

This note proves two theorems regarding Fermat-type equation $x^r + y^r = dz^p$ where $r \geq 5$ is a prime. Our main result shows that, for infinitely many integers~$d$, the previous equation has no non-trivial primitive solutions such…

We describe a strategy to attack infinitely many Fermat-type equations of signature $(r,r,p)$, where $r \geq 7$ is a fixed prime and $p$ is a prime allowed to vary. We use a variant of the modular method over totally real subfields of…

In this paper we are interested in solving the Fermat-type equations x^5+y^5=dz^p where d is a positive integer and p a prime number $\ge 7$. We describe a new method based on modularity theorems which allows us to improve all the results…

Let $E/\mathbb Q$ be an elliptic curve and $p \geq 3$ a prime. The modular curve $X_E^-(p)$ parameterizes elliptic curves with $p$-torsion modules anti-symplectically isomorphic to $E[p]$. The work of Freitas--Naskr\k{e}cki--Stoll uses the…

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…

We prove two results concerning the generalized Fermat equation $x^4+y^4=z^p$. In particular we prove that the First Case is true if $p \neq 7$.

We study the Generalized Fermat Equation $x^2 + y^3 = z^p$, to be solved in coprime integers, where $p \ge 7$ is prime. Using modularity and level lowering techniques, the problem can be reduced to the determination of the sets of rational…

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…

In this paper we prove new cases of the asymptotic Fermat equation with coefficients. This is done by solving remarkable $S$-units equations and applying a method of Frey-Mazur.

Using a combination of several powerful modularity theorems and class field theory we derive a new modularity theorem for semistable elliptic curves over certain real abelian fields. We deduce that if $K$ is a real abelian field of…

Let $p\geq 3$ be a prime number. A Fermat curve over $\mathbb{Q}$ of exponent $p$ is defined by an equation of the shape $ax^p+by^p+cz^p=0$, where $a,b,c$ are non-zero rational numbers. We prove in this article that there exist infinitely…

In this paper we prove that equations of the form $x^{13} + y^{13} = Cz^{p}$ have no non-trivial primitive solutions (a,b,c) such that $13 \nmid c$ if $p > 4992539$ for an infinite family of values for $C$. Our method consists in relating a…

In this paper, we give a resolution of the generalized Fermat equations $$x^5 + y^5 = 3 z^n \text{ and } x^{13} + y^{13} = 3 z^n,$$ for all integers $n \ge 2$, and all integers $n \ge 2$ which are not a multiple of $7$, respectively, using…

We give a cyclotomic proof of the fact that the equation $\frac{x^p + y^p}{x+y} = p^e z^q$ has no solutions in coprime integers $x,y,z$ and $p > 3; q$, a pair of distinct odd primes.

We give a cyclotomic proof of the fact that the equation $\frac{x^p + y^p}{x+y} = p^e z^p$ has no solutions in coprime integers $x,y,z$ and $p > 3$, a prime. This implies in particular Fermat's Last Theorem.

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

In this article we study solutions to the generalized Fermat equation $x^q+y^p+z^r=0 $ using hypergeometric motives within the framework of the modular method. In doing so, we give an explicit description of the ramification behavior at…

Fix a rational prime $r \geq 5$. In this article, we study the integer solutions of the generalized Fermat equation of signature $(2p,2q,r)$, namely $x^{2p}+y^{2q}=z^r$, where the primes $p,q \geq 5$ are varying. For each rational prime $r…

For a prime $p$ and an integer $a \in \Z$ we obtain nontrivial upper bounds on the number of solutions to the congruence $x^x \equiv a \pmod p$, $1 \le x \le p-1$. We use these estimates to estimate the number of solutions to the congruence…

We consider some diophantine problems suggested by the analogy between multiplicative groups and powers of the modular curve in problems of "unlikely intersections." We prove a special case of the Zilber-Pink conjecture for curves.