ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ke ℓk e \,\ell be integers with ℓ>k≥2\ell>k\geq 2. The kk-generalized Fibonacci sequence F(k)=(Fn(k))n≥−(k−2)F^{(k)}=(F_n^{(k)})_{n\geq -(k-2)} has initial values 0,0,…,0,10,0,\ldots,0,1 (kk terms), with first nonzero term F1(k)=1F_1^{(k)}=1, and satisfies

Fn+k(k)=Fn+k−1(k)+Fn+k−2(k)+⋯+Fn(k).F_{n+k}^{(k)}=F_{n+k-1}^{(k)}+F_{n+k-2}^{(k)}+\cdots+F_n^{(k)}.

Noe–Post conjecture. The Diophantine equation

Fm(k)=Fn(ℓ),F_m^{(k)}=F_n^{(\ell)},

with n>ℓ+1n>\ell+1 and m>k+1m>k+1, has only the solutions

(m,n,ℓ,k)=(7,6,3,2)and(12,11,7,3).(m,n,\ell,k)=(7,6,3,2)\quad\text{and}\quad(12,11,7,3).

Equivalently, the intersections of the sequences are expected to consist only of the common initial terms together with 13=F7(2)=F6(3)13=F_7^{(2)}=F_6^{(3)} and 504=F12(3)=F11(7)504=F_{12}^{(3)}=F_{11}^{(7)}. The paper confirms this conjecture, so the claim is solved.

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.