The primitive solutions to x3+y9=z2
Nils Bruin
Abstract
We determine the rational integers x,y,z such that x3+y9=z2 and gcd(x,y,z)=1. First we determine a finite set of curves of genus 10 such that any primitive solution to x3+y9=z2 corresponds to a rational point on one of those curves. We observe that each of these genus 10 curves covers an elliptic curve over some extension of Q. We use this cover to apply a Chabauty-like method to an embedding of the curve in the Weil restriction of the elliptic curve. This enables us to find all rational points and therefore deduce the primitive solutions to the original equation.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan