2000 character limit reached
On the Fermat-type Equation $x^3 + y^3 = z^p$
Published 24 Jan 2016 in math.NT | (1601.06361v1)
Abstract: We prove that the Fermat-type equation $x3 + y3 = zp$ 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 prime exponents to which the previous equation is known to not have such solutions. For the proof we develop a criterion of independent interest to decide if two elliptic curves with certain type of potentially good reduction at 2 have symplectically or anti-symplectically isomorphic $p$-torsion modules.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.