ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let F1=F2=1F_1=F_2=1 and Ft+2=Ft+1+FtF_{t+2}=F_{t+1}+F_t for t≥1t\geq 1. For each n≥2n\geq 2, write uniquely n=aFt+bFt−1n=aF_t+bF_{t-1} with t≥2t\geq 2 and 1≤a≤b≤Ft1\leq a\leq b\leq F_t. Let D={d1<d2<⋯ }D=\{d_1<d_2<\cdots\} be the set of integers nn whose associated index tt is even, and let U={u1<u2<⋯ }U=\{u_1<u_2<\cdots\} be the set of integers nn whose associated index tt is odd. For every ℓ≥1\ell\geq 1, define Dℓ={dk+ℓ−dk:k≥1}D_\ell=\{d_{k+\ell}-d_k:k\geq 1\} and Uℓ={uk+ℓ−uk:k≥1}U_\ell=\{u_{k+\ell}-u_k:k\geq 1\}. The conjecture asserts that Dℓ=UℓD_\ell=U_\ell for every integer ℓ≥1\ell\geq 1.

Record

Added
Links

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.