Papers
Topics
Authors
Recent
Search
2000 character limit reached

Superelliptic equations arising from sums of consecutive powers

Published 22 Sep 2015 in math.NT | (1509.06619v1)

Abstract: Using only elementary arguments, Cassels solved the Diophantine equation $(x-1)3+x3+(x+1)3=z2$ in integers $x$, $z$. The generalization $(x-1)k+xk+(x+1)k=zn$ (with $x$, $z$, $n$ integers and $n \ge 2$) was considered by Zhongfeng Zhang who solved it for $k=2$, $3$, $4$ using Frey-Hellegouarch curves and their Galois representations. In this paper, by employing some sophisticated refinements of this approach, we show that the only solution for $k=5$ is $x=z=0$, and that there are no solutions for $k=6$. The chief innovation we employ is a computational one, which enables us to avoid the full computation of data about cuspidal newforms of high level.

Citations (20)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.