The cubic binary-form perfect-power conjecture

Let FF be a separable homogeneous cubic binary form with integer coefficients, let dd be a fixed integer with d1d\geq 1, and let ll be a prime number. Cubic binary-form perfect-power conjecture. There exists a constant Cd,F>0C_{d,F}>0, depending only on dd and FF, such that if l>Cd,Fl>C_{d,F} and

F(a,b)=dclF(a,b)=dc^l

with gcd(a,b)=1\gcd(a,b)=1, then c=±1c=\pm1. This conjecture is given as a sufficient statement from which the earlier large-exponent conjecture would follow; the paper does not establish it.

Sources & referencesView supporting material

Primary source

Jonathan Reynolds, “Perfect powers in elliptic divisibility sequences”, arXiv:1101.2949 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.