English
Related papers

Related papers: On the equation $a^p + 2^alpha b^p + c^p =0$

200 papers

The Fermat quotient $q_p(a):=(a^{p-1}-1)/p$, for prime $p\nmid a$, and the Wilson quotient $w_p:=((p-1)!+1)/p$ are integers. If $p\mid w_p,$ then $p$ is a Wilson prime. For odd $p,$ Lerch proved that $(\sum_{a=1}^{p-1} q_p(a) - w_p)/p$ is…

Number Theory · Mathematics 2014-12-16 Jonathan Sondow

We solve the Diophantine equations $x^5 + y^5 = dz^p$ with $d=2, 3$ for a set of prime numbers of density 1/4, 1/2, respectively. The method consists in relating a possible solution to another Diophantine equation and solving the later by…

Number Theory · Mathematics 2011-03-29 Luis Dieulefait , Nuno Freitas

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.

General Mathematics · Mathematics 2009-06-06 Kaida Shi

Motivated by their research on automorphism groups of pseudo-real Riemann surfaces, Bujalance, Cirre and Conder have conjectured that there are infinitely many primes $p$ such that $p+2$ has all its prime factors $q\equiv -1$ mod~$(4)$. We…

Number Theory · Mathematics 2024-01-22 Gareth A. Jones , Alexander K. Zvonkin

It is known that $\sum_{k=0}^\infty\binom{2k}{k}/((2k+1)4^k)=\pi/2$ and $\sum_{k=0}^\infty\binom{2k}{k}/((2k+1)16^k)=\pi/3$. In this paper we obtain their p-adic analogues such as…

Number Theory · Mathematics 2011-08-03 Zhi-Wei Sun

Let $N$ be an odd perfect number. Then, Euler proved that there exist some integers $n, \alpha$ and a prime $q$ such that $N = n^{2}q^{\alpha}$, $q \nmid n$, and $q \equiv \alpha \equiv 1 \bmod 4$. In this note, we prove that the ratio…

Number Theory · Mathematics 2023-12-01 Yoshinosuke Hirakawa

We prove a diophantine result on generalized Fermat equations of the form $x^p + y^p = z^r$ which for the first time requires the use of Frey abelian varieties of dimension $\geq 2$ in Darmon's program. For that, we provide an…

Number Theory · Mathematics 2016-05-10 Nicolas Billerey , Imin Chen , Luis Dieulefait , Nuno Freitas

Given a squarefree positive integer $d$, we want to find integers (or rational numbers with denominators not divisible by large primes) $a_0,a_1,a_2,\ldots$ such that for sufficiently large primes $p$ we have $\sum_{k=0}^{p-1}a_k\equiv…

Number Theory · Mathematics 2014-02-21 Zhi-Wei Sun

Let $p>3$ be a prime, and let $(\frac{\cdot}p)$ be the Legendre symbol. Let $b\in\mathbb Z$ and $\varepsilon\in\{\pm 1\}$. We mainly prove that $$\left|\left\{N_p(a,b):\ 1<a<p\ \text{and}\ \left(\frac…

Number Theory · Mathematics 2022-10-07 Qing-Hu Hou , Hao Pan , Zhi-Wei Sun

Generalised Fermat equation (GFE) is the equation of the form $ax^p+by^q=cz^r$, where $a,b,c,p,q,r$ are positive integers. If $1/p+1/q+1/r<1$, GFE is known to have at most finitely many primitive integer solutions $(x,y,z)$. A large body of…

Number Theory · Mathematics 2025-04-15 Ashleigh Ratcliffe , Bogdan Grechuk

Catalan's conjecture claims that the Diophantine equation $x^p-y^q=1$ admits the unique solution $3^2-2^3=1$ in integers $x,y,p,q \ge 2$. The conjecture has been finally proved by P. Mih\u{a}ilescu (2002) using the theory of cyclotomic…

Number Theory · Mathematics 2017-02-14 Paolo Leonetti

Let $(a,b,c)$ be a primitive Pythagorean triple. Set $a=m^2-n^2$,$b=2mn$, and $c=m^2+n^2$ with $m$ and $n$ positive coprime integers, $m>n $ and $ m \not \equiv n \pmod 2$. A famous conjecture of Je\'{s}manowicz asserts that the only…

Number Theory · Mathematics 2020-10-17 Amir Ghadermarzi

Let $p \geq 5$ be a prime and for $a, b \in \mathbb{F}_{p}$, let $E_{a,b}$ denote the elliptic curve over $\mathbb{F}_{p}$ with equation $y^2=x^3+a\,x + b$. As usual define the trace of Frobenius $a_{p,\,a,\,b}$ by \begin{equation*}…

Number Theory · Mathematics 2019-01-04 Saiying He , James Mc Laughlin

Given odd, coprime integers $a$, $b$ ($a>0$), we consider the Diophantine equation $ax^2+b^{2l}=4y^n$, $x, y\in\Bbb Z$, $l \in \Bbb N$, $n$ odd prime, $\gcd(x,y)=1$. We completely solve the above Diophantine equation for…

Number Theory · Mathematics 2020-01-15 Andrzej Dąbrowski , Nursena Günhan , Gökhan Soydan

This paper studies integer solutions to the ABC equation A+B+C=0 in which none of A, B, C has a large prime factor. Set H(A,B, C)= max(|A|,|B|,|C|) and set the smoothness S(A, B, C) to be the largest prime factor of ABC. We consider…

Number Theory · Mathematics 2011-07-11 Jeffrey C. Lagarias , K. Soundararajan

In this paper we consider the Diophantine equation $x^2+q^{2m}=2y^p$ where $m,p,q,x,y$ are integer unknowns with $m>0,$ $p$ and $q$ are odd primes and $\gcd(x,y)=1.$ We prove that there are only finitely many solutions $(m,p,q,x,y)$ for…

Number Theory · Mathematics 2015-06-26 Szabolcs Tengely

We prove that there exists an absolute constant $c>0$ such that if an arithmetic progression $\cP$ modulo a prime number $p$ does not contain zero and has the cardinality less than $cp$, then it can not be represented as a product of two…

Number Theory · Mathematics 2013-09-27 M. Z. Garaev , S. V. Konyagin

Recent work of Freitas and Siksek showed that an asymptotic version of Fermat's Last Theorem holds for many totally real fields. Later this result was extended by Deconinck to generalized Fermat equations of the form $Ax^p +By^p +Cz^p = 0$,…

Number Theory · Mathematics 2019-04-09 Yasemin Kara , Ekin Ozman

In a recent work the authors prove the effective asymptotic Fermat's Last Theorem for the infinite family of fields $\mathbb{Q}(\zeta_{2^{r+2}})^+$ where $r \ge 0$. A crucial step in their proof is the following conjecture of Kraus. Let $K$…

Number Theory · Mathematics 2020-12-08 Nuno Freitas , Alain Kraus , Samir Siksek

This paper applies the modular approach to obtain effectively computable bounds for Fermat-type equations over number fields, while also discussing the differences and obstructions that arise when considering such equations over totally…

Number Theory · Mathematics 2026-02-25 Begum Gulsah Cakti
‹ Prev 1 3 4 5 6 7 10 Next ›