Skip to main content

TL;DR

Fibonacci via Generating Functions: A canonical quantitative trading interview question at olympiad difficulty. Commonly asked at Jane Street, DE Shaw, HRT.

By Valenke Exam Prep Team·Last updated 2026-06-01
olympiadGenerating Functions & Recurrences

Fibonacci via Generating Functions

Asked at: Jane Street, DE Shaw, HRT

Problem
Derive the closed-form formula for the nn-th Fibonacci number FnF_n using generating functions. F0=0,  F1=1,  Fn=Fn−1+Fn−2F_0 = 0,\; F_1 = 1,\; F_n = F_{n-1} + F_{n-2} for n≥2n \geq 2.
Related concepts
Generating Function

Ready to practice for the Valenke Finance Exam?

Adaptive practice powered by Item Response Theory targets your weak areas. Start with 3 free sessions.

Start free practice →
Practice similar problemsAll core problems