ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the trinary trees generated by (2,1)(2,1) and (3,1)(3,1). For a relatively prime pair (m,n)(m,n), let (u,v)(u,v) be the pair in a Bézout tree corresponding to (m,n)(m,n), and let (U,V)(U,V) be the pair given by the gcd\texttt{gcd} function for the same pair (m,n)(m,n). Bézout tree conjecture. The following hold: for every (u,v)(u,v) in the Bézout tree of (3,1)(3,1) generated by (0,1)(0,1), one has

(u,v)=(U,V).(u,v)=(U,V).

One third of the (u,v)(u,v) in the Bézout tree of (2,1)(2,1) generated by (0,1)(0,1) are not equal to (U,V)(U,V). If the value of g(0,−1)g(0,-1) in the second level of this Bézout tree is changed from (−1,2)(-1,2) to (1,−1)(1,-1), then the resulting tree satisfies

(u,v)=(U,V)(u,v)=(U,V)

for every (u,v)(u,v). These claims arise from computations of the Bézout tree to depth 1313, and describe when the tree-generated pairs agree with the pairs produced by the Euclidean algorithm; their general validity is not established in the source.

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.