Papers
Topics
Authors
Recent
Search
2000 character limit reached

Rational Points on Erdos-Selfridge Superelliptic Curves

Published 19 Oct 2015 in math.NT | (1510.05376v1)

Abstract: Given $k \geq 2$, we show that there are at most finitely many rational numbers $x$ and $y \neq 0$ and integers $\ell \geq 2$ (with $(k,\ell) \neq (2,2)$) for which $$ x (x+1) \cdots (x+k-1) = y\ell. $$ In particular, if we assume that $\ell$ is prime, then all such triples $(x,y,\ell)$ satisfy either $y=0$ or $\log \ell < 3k$.

Citations (8)

Summary

Paper to Video (Beta)

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.

Authors (2)

Collections

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