ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let b≥2b\geq 2 be the fixed integer base. Let α\alpha and β\beta be irrational algebraic numbers, and let ϵ>0\epsilon>0. For nonnegative integers kk and mm, define

f(k,m)=[αbk+m][βbm]+1.f(k,m)=[\alpha b^{k+m}][\beta b^m]+1.

The first nonlinear gcd conjecture. For sufficiently large mm,

gcd⁡(f(k,m),bm)<bϵm.\operatorname{gcd}(f(k,m),b^m)<b^{\epsilon m}.

The source presents this as one of three illustrative open questions about extending its linear congruence estimates to nonlinear congruences.

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.