ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A=xn+x+1A=x^n+x+1 with n≥2n\geq 2, and let A1,A3,…A_1,A_3,\ldots be the odd subsequence in the binary-polynomial Collatz transformation. Let ss be the greatest integer such that n−2s+1≥1n-2^{s+1}\geq 1. Repeated-degree conjecture. For any positive integer t≤s−1t\leq s-1, the odd sequence contains 2t2^t polynomials having the same degree dtd_t. In particular,

d1=deg⁡(A5)=deg⁡(A7)d_1=\deg(A_5)=\deg(A_7)

and

d2=deg⁡(A9)=deg⁡(A11)=deg⁡(A13)=deg⁡(A15).d_2=\deg(A_9)=\deg(A_{11})=\deg(A_{13})=\deg(A_{15}).

This is one of two conjectures stated for the family xn+x+1x^n+x+1. It describes a pattern in the degrees of odd iterates; the supplied text gives examples but no resolution.

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.