ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let b≥2b\geq 2 be the fixed integer base. Let α\alpha and β\beta be the irrational algebraic numbers and let ϵ>0\epsilon>0 be as in the preceding conjectures. For a positive integer mm, define

f(m)=[β[αbm]2].f(m)=[\beta[\alpha b^m]^2].

The third nonlinear gcd conjecture. For sufficiently large mm,

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

The source gives this as a further illustrative open question about nonlinear congruences; no resolution is supplied.

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.