English
Related papers

Related papers: Fermat's Equation Has No Solution with Some Prime …

200 papers

E26 in the Enestrom index. Translated from the Latin original, "Observationes de theoremate quodam Fermatiano aliisque ad numeros primos spectantibus" (1732). In this paper Euler gives a counterexample to Fermat's claim that all numbers of…

History and Overview · Mathematics 2008-04-15 Leonhard Euler

The Tijdeman-Zagier conjecture states no integer solution exists for $A^X+B^Y=C^Z$ with positive integer bases and integer exponents greater than 2 unless gcd$(A,B,C)>1$. Any set of values that satisfy the conjecture correspond to a lattice…

Number Theory · Mathematics 2021-03-16 David Hauser , Ian Hauser

Let $n \in \mathbb{Z}_{\geq 2}$. We study the generalized Fermat equation \[x^{13}+y^{13}=z^n, \quad x,y,z \in \mathbb{Z}, \quad \gcd(x,y,z)=1.\] Using a combination of techniques, including the modular method, classical descent, unit…

Number Theory · Mathematics 2025-10-15 Alex J. Best , Sander R. Dahmen , Nuno Freitas

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…

Number Theory · Mathematics 2024-07-09 Nicolas Billerey , Imin Chen , Luis Dieulefait , Nuno Freitas

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…

Number Theory · Mathematics 2013-11-01 Nuno Freitas

Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…

Quantum Physics · Physics 2019-08-21 Alvaro Donis-Vela , Juan Carlos Garcia-Escartin

We give a method to solve generalized Fermat equations of type $x^4 + y^4 = q z^p$, for some prime values of $q$ and every prime $p$ bigger than 13. We illustrate the method by proving that there are no solutions for $q= 73, 89$ and 113.

Number Theory · Mathematics 2007-05-23 Luis Dieulefait

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\}$.

Logic · Mathematics 2016-05-25 Mauro Di Nasso , Maria Riggio

We prove that the Fermat-type equation $x^3 + y^3 = z^p$ has no solutions $(a,b,c)$ satisfying $abc \ne 0$ and $\gcd(a,b,c)=1$ when $-3$ is not a square mod~$p$. This improves to approximately $0.844$ the Dirichlet density of the set of…

Number Theory · Mathematics 2016-01-26 Nuno Freitas

In 1876, Edouard Lucas showed that if an integer $b$ exists such that $b^{n-1} \equiv 1 (\mathrm{mod} \ n)$ and $b^{(n-1)/p} \not\equiv 1( \mathrm{mod} \ n)$ for all prime divisors $p$ of $n-1$ , then $n$ is prime, a result known as Lucas's…

Number Theory · Mathematics 2021-04-13 Ariko Stephen Philemon

We look at upper bounds for the count of certain primes related to the Fermat numbers $F_n=2^{2^n}+1$ called elite primes. We first note an oversight in a result of Krizek, Luca and Somer and give the corrected, slightly weaker upper bound.…

Number Theory · Mathematics 2021-02-02 Matthew Just

This article, complement to the article [Que], deals with some generalizations of Futw\"angler's theorems for the second case of Fermat's Last Theorem (FLT2). Let $p$ be an odd prime, $\zeta$ a $p$th primitive root of unity, $K:=\Q(\zeta)$…

Number Theory · Mathematics 2013-04-24 Roland Quême

We show that for any relatively prime integers $1\leq p<q$ and for any finite $A \subset \mathbb{Z}$ one has $$|p \cdot A + q \cdot A | \geq (p + q) |A| - (pq)^{(p+q-3)(p+q) + 1}.$$

Number Theory · Mathematics 2013-11-20 Antal Balog , George Shakan

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…

Number Theory · Mathematics 2025-10-07 Nuno Freitas , Michael Stoll

On the twisted Fermat cubic, an elliptic divisibility sequence arises as the sequence of denominators of the multiples of a single rational point. We prove that the number of prime terms in the sequence is uniformly bounded. When the…

Number Theory · Mathematics 2010-04-14 Graham Everest , Ouamporn Phuksuwan , Shaun Stevens

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

General Mathematics · Mathematics 2018-02-08 Richard Williamson

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…

Number Theory · Mathematics 2017-05-05 Sofia Lindqvist

In this paper, we begin the study of the Fermat equation $x^n+y^n=z^n$ over real biquadratic fields. In particular, we prove that there are no non-trivial solutions to the Fermat equation over $\mathbb{Q}(\sqrt{2},\sqrt{3})$ for $n\geq 4$.

Number Theory · Mathematics 2025-02-26 Maleeha Khawaja , Frazer Jarvis

Let $n\in\mathbb{Z}^+$. Is it true that every sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number? In this paper we show that this is actually the case for every $n \leq…

Number Theory · Mathematics 2014-04-04 Germán Paz

We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in…

Number Theory · Mathematics 2024-07-11 William Craig , Jan-Willem van Ittersum , Ken Ono