2000 character limit reached
Sylvester's Problem and Mock Heegner Points
Published 18 Jul 2017 in math.NT | (1707.05874v1)
Abstract: We prove that if $p \equiv 4,7 \pmod{9}$ is prime and $3$ is not a cube modulo $p$, then both of the equations $x3+y3=p$ and $x3+y3=p2$ have a solution with $x,y \in \mathbb{Q}$.
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.