Strong growth conjecture for Fibonacci-polynomial cycles with m = 8 + 12(61 + 64d)
Statement
Let with for some nonnegative integer . Define the sequence as in the preceding definition, with and selected according to the parity of , and with each subsequent pair determined by whether is a length-two cycle strongly growing at level . Strong growth conjecture. For every , the Fibonacci polynomial has a cycle of length that strongly grows at level . The authors report computational evidence for many values of , but the apparently random sequence prevents a proof of strong growth and the conjecture remains open.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.