Related papers: Solving Fermat-type equations x^5+y^5=dz^p

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)

Recent results of Freitas, Kraus, Sengun and Siksek give sufficient criteria for the asymptotic Fermat's Last Theorem to hold over various number fields. In this paper, we prove asymptotic results about the solutions of the Diophantine…

In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p…

Let $K$ be a totally real field, and $r\geq 5$ a fixed rational prime. In this paper, we use the modular method as presented in the recent work of Freitas and Siksek to study non-trivial, primitive solutions $(x,y,z) \in \mathcal{O}_K^3$ of…

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 $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…

In this paper we study the Fermat equation $x^n+y^n=z^n$ over quadratic fields $\mathbb{Q}(\sqrt{d})$ for squarefree $d$ with $26 \leq d \leq 97$. By studying quadratic points on the modular curves $X_0(N)$, $d$-regular primes, and working…

Let $p$ be a prime number. In the early 2000s, it was proved that the Fermat equations with coefficients \[3x^p + 8y^p + 21z^p =0\quad \text{ and } \quad 3x^p + 4y^p + 5z^p=0 \] do not admit non-trivial solutions for a set of exponents $p$…

We follow the ideas of Darmon's program for solving infinite families of generalised Fermat equations of signatures $(p,p,r)$ and $(r,r,p)$, where, $r$ is a fixed prime and $p$ is varying. We do so by introducing a common framework for both…

The main aim of this article is to find all solutions of the Diophantine equation $x^2 + p^k=y^n$ where $p \equiv 1 \pmod 4$, $\frac{p-1}{3}$ is a perfect square and the class number of $\mathbb{Z}[\sqrt{-p}]$ is $2$. In this article, I…

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…

It is shown that the quartic Fermat equation $x^4 +y^4=1$ has nontrivial integral solutions in the Hilbert class field $\Sigma$ of any quadratic field $K=\mathbb{Q}(\sqrt{-d})$ whose discriminant satisfies $-d \equiv 1$ (mod 8). A corollary…

We classify primitive integer solutions to x^2 + y^3 = z^10. The technique is to combine modular methods at the prime 5, number field enumeration techniques in place of modular methods at the prime 2, Chabauty techniques for elliptic curves…

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…

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…

The solvability of Diophantine quartic equations is a contemporary area of interest due to its connection with generalized Fermat's equation. In this work, we are interested in the integer solutions of a similar Diophantine equation p u^2 =…

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…

Following the famous proof of Fermat's Last Theorem by Andrew Wiles using the modularity of elliptic curves over $\mathbb{Q}$, significant developments have been made in the study of Diophantine equations using the modularity method. This…

The purpose of the present article is to show how the modular method together with different techniques can be used to prove non-existence of primitive non-trivial solutions of the equation $x^2+dy^6=z^p$ for square-free values $1 \le d \le…