I am attempting to solve for $n$ in the equation:


where $F_n$ is the $n$th Fibonacci number. I know that $g_0$ and $g_1$ will be positive integers such that $0 < g_1 \leq g_2$. I am given $g_n$ and $g_{n-1}$ to begin with, and I have the following identities to work with:





My current solution is very messy and, importantly, incomplete. I began by renaming a couple variables: $g_n=a$, $g_{n-1}=b$, and $g_{n-2}=c$. Which allows me to do the following:


and I used that to infer $b=F_ng_2$ and $c=F_{n-1}g_1$, but I do not have proof for that. I tried going from here to get rid of the terms $g_1$ and $g_2$, but this gets very messy very quickly once you begin to unpack everything. I really need some help figuring out where to go from here. Any advice at all would be greatly appreciated. I need to avoid the recursive definition of this function at all costs.

  • $\begingroup$ Are you familiar with the method of generating functions? $\endgroup$ – Sean Roberson May 18 '18 at 17:06
  • $\begingroup$ I don't understand the question. Suppose $g_n=F_n$, the usual Fibonacci sequence. What is your solution in this case? What is it you are even solving for? $\endgroup$ – lulu May 18 '18 at 17:30
  • $\begingroup$ Voting to close the question as it is not clear what you are asking. If you can, please edit for clarity. Maybe work an example of what you are trying to solve for. $\endgroup$ – lulu May 18 '18 at 18:07

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.