ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the Fibonacci recurrence an=an−1+an−2a_n=a_{n-1}+a_{n-2} and its chiral recurrence an=−an−1+an−2a_n=-a_{n-1}+a_{n-2} with random integer initialization (a0,a1)∈Z2(a_0,a_1)\in\mathbb Z^2. Let FnF_n and LnL_n denote the Fibonacci and Lucas numbers, and let P(n)P(n) be the probability that the sequence has its absolute minimum at position nn. Probability distribution of Fibonacci minima.

P(n)={14,n=0,1π(arctan⁡(Ln−2Ln−1)−arctan⁡(LnLn+1)),n>1 and n even,1π(arctan⁡(LnLn+1)−arctan⁡(Ln−2Ln−1)),n>1 and n odd.P(n)=\begin{cases}\dfrac14,&n=0,\\[4pt]\dfrac1\pi\left(\arctan\left(\dfrac{L_{n-2}}{L_{n-1}}\right)-\arctan\left(\dfrac{L_n}{L_{n+1}}\right)\right),&n>1\text{ and }n\text{ even},\\[6pt]\dfrac1\pi\left(\arctan\left(\dfrac{L_n}{L_{n+1}}\right)-\arctan\left(\dfrac{L_{n-2}}{L_{n-1}}\right)\right),&n>1\text{ and }n\text{ odd}. \end{cases}

Moreover, P(n)=P(1−n)P(n)=P(1-n). The supplied text gives no resolution status.

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.