ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn, ss, and tt be integers with (n,s)=1(n,s)=1 and 1≤s,t<n1\leq s,t<n. Assume that for every integer pp with (p,n)=1(p,n)=1,

n2<ps mod n+pt mod n<3n2.\frac{n}{2}<ps\bmod n+pt\bmod n<\frac{3n}{2}.

Kenyon–Smillie conjecture. One of the following conditions holds: n≤78n\leq 78, s+t=ns+t=n, s+2t=ns+2t=n, 2s+t=n2s+t=n, or nn is even and ∣t−s∣=n2|t-s|=\frac{n}{2}. This arithmetic conjecture would remove the denominator bound in Kenyon and Smillie's classification of acute non-isosceles rational-angled triangles with the lattice property.

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.