ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let aa be a positive integer, and let τs(a)\tau_s(a) denote the sequence defined in the paper, counting the relevant rational squares at parameter ss. Assume that neither aa nor a+1a+1 is a square integer.

Descent conjecture. For every integer k>0k>0, there exists some ss such that

τs(a)=k\tau_s(a)=k

and

τs+1(a)=k−1.\tau_{s+1}(a)=k-1.

This conjecture proposes that, except when aa or a+1a+1 is a square integer, the sequence τs(a)\tau_s(a) is not non-decreasing: every positive value kk occurs immediately before a drop to k−1k-1. The supplied text presents this as a proposal based on computational observations; no resolution is given.

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.