Abstract
We show that there exists an upper bound for the number of squares in arithmetic progression over a number field that depends only on the degree of the field. We show that this bound is 5 for quadratic fields, and also that the result generalizes to k-powers for integers k > 1 .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have