Searcharxiv⌕ Search

arXiv subjects

Nuno Freitas

Publications and source records attributed to Nuno Freitas.

39 records · Page 3Linked to original sources

Recipes to Fermat-type equations of the form x^r + y^r = Cz^p

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 $\mathbb{Q}(ζ_r)$. In particular, to a solution $(a,b,c)$ of $x^r + y^r =Cz^p$ we will attach several Frey curves $E=E_{(a,b)}$. We prove modularity of all the Frey curves and the exsitence of a constant constant $M_r$, depending only on $r$, such that for all $p>M_r$ the representations $\barρ_{E,p}$ are absolutely irreducible. Along the way, we also prove modularity of certain elliptic curves that are semistable at all $v \mid 3$.\par Finally, we illustrate our methods by proving arithmetic statements about equations of signature $(7,7,p)$. Among which we emphasize that, using a multi-Frey technique, we show there is some constant $M$ such that if $p > M$ then the equation $x^7 + y^7 = 3z^p$ has no non-trivial primitive solutions.

math.NT↗

Fermat-type equations of signature (13,13,p) via Hilbert cuspforms

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 solution (a,b,c) to the previous equation to a solution (a,b,c_1) of another Diophantine equation with coefficients in $\Q(\sqrt{13})$. We then construct Frey-curves associated with (a,b,c_1) and we prove modularity of them in order to apply the modular approach via Hilbert cusp forms over $\Q(\sqrt{13})$. We also prove a modularity result for elliptic curves over totally real cyclic number fields of interest by itself.

math.NT↗

The Fermat-type equations x^5 + y^5 = 2z^p or 3z^p solved through Q-curves

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 using Q-curves and a generalized modular technique as in work of Ellenberg and Dieulefait-Jimenez along with some new techniques for eliminating newforms.

math.NT↗