中文
相关论文

相关论文: On the equation $x^2+dy^6=z^p$ for square-free $1\…

200 篇论文

We show that the existence of a non-trivial solution of $x^n+y^n=p^n$, with $p$ a prime number, is equivalent to the existence of a solution of a certain (over-determined) system of $(n-1)$-recursion relations ("zipper" equations) in…

综合数学 · 数学 2017-08-11 Yochay Jerby

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…

数论 · 数学 2016-09-07 Samuele Anni , Samir Siksek

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…

数论 · 数学 2012-01-31 Luis Dieulefait , Nuno Freitas

Using modularity, level lowering, and explicit computations with Hilbert modular forms, Galois representations and ray class groups, we show that for $3 \le d \le 23$ squarefree, $d \ne 5$, $17$, the Fermat equation $x^n+y^n=z^n$ has no…

数论 · 数学 2016-01-20 Nuno Freitas , Samir Siksek

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…

数论 · 数学 2022-10-18 Philippe Michaud-Jacobs

In this paper, we determine the primitive solutions of the Diophantine equation $(x-d)^2+x^2+(x+d)^2=y^n$ when $n\geq 2$ and $d=p^b$, $p$ a prime and $p\leq 10^4$. The main ingredients are the characterization of primitive divisors on…

数论 · 数学 2019-05-16 Angelos Koutsianas

Let $f$ and $g$ be two different newforms without complex multiplication having the same coefficient field. The main result of the present article proves that a congruence between the Galois representations attached to $f$ and to $g$ for a…

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…

数论 · 数学 2016-01-26 Nuno Freitas

We determine the rational integers x,y,z such that x^3+y^9=z^2 and gcd(x,y,z)=1. First we determine a finite set of curves of genus 10 such that any primitive solution to x^3+y^9=z^2 corresponds to a rational point on one of those curves.…

数论 · 数学 2008-10-21 Nils Bruin

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…

数论 · 数学 2026-02-25 Begum Gulsah Cakti

In this survey, we studied the possibility of finding rational solutions to the equation $Ax^p+By^p+Cz^p=0$ via its attached hyperelliptic curve $Y^2=X^p+A^2(BC)^{p-1}/4$ and its rational points computed using computational tools.

数论 · 数学 2025-05-16 Alejandro Argáez-García

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…

数论 · 数学 2014-02-21 Zhi-Wei Sun

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…

数论 · 数学 2009-05-21 Konstantine Zelator

The primary aim of this paper is to study the generalized Fermat equation \[ x^2+y^{2n} = z^{3p} \] in coprime integers $x$, $y$, and $z$, where $n \geq 2$ and $p$ is a fixed prime. Using modularity results over totally real fields and the…

数论 · 数学 2022-04-14 Philippe Michaud-Jacobs

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…

数论 · 数学 2019-06-17 Nuno Freitas , Bartosz Naskrecki , Michael Stoll

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.

数论 · 数学 2020-11-10 Luis Dieulefait , Eduardo Soto

Let $f(x)$ be a nonconstant polynomial with integer coefficients and nonzero discriminant. We study the distribution modulo primes of the set of squarefree integers $d$ such that the curve $dy^2=f(x)$ has a nontrivial rational or integral…

数论 · 数学 2019-03-22 David Krumm , Paul Pollack

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…

数论 · 数学 2025-09-26 Satyabrat Sahoo

We prove an asymptotic formula for squarefree in arithmetic progressions with squarefree moduli, improving previous results by Prachar. The main tool is an estimate for counting solutions of a congruence inside a box that goes beyond what…

数论 · 数学 2017-03-29 Ramon M. Nunes

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

数论 · 数学 2014-07-21 David Krumm