ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let F∈Z[x,y]F\in\mathbb Z[x,y] be a binary form with nonzero discriminant and degree at least three. For an integer mm, consider the Thue equation

F(x,y)=m.F(x,y)=m.

A solution (x,y)(x,y) is primitive when gcd⁡(x,y)=1\gcd(x,y)=1. Stewart's conjecture. There exists an absolute constant c0c_0 such that, for every such FF, there is a number C=C(F)C=C(F) with the property that whenever m>Cm>C, the equation has at most c0c_0 solutions in coprime integers xx and yy.

This conjecture proposes a bound independent of both FF and mm once mm is sufficiently large relative to FF. The supplied text gives no evidence of resolution, so its status remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.