maths.free › Combinatorics & Graph Theory › Recurrences and generating functions

Recurrences and generating functions

Solving recurrence relations, and encoding a sequence as a power series.

A recurrence defines aₙ from earlier terms; a generating function Σ aₙ xⁿ packs the whole sequence into one function whose algebra does the counting. Picture it: the Fibonacci numbers growing by the golden ratio each step. Think it: linear recurrences with constant coefficients are solved exactly like constant-coefficient differential equations, a characteristic polynomial.

Radni primjer · fib(25)

Number-Theory · Sequences

Fib(25)

25

Korak po korak

  1. F_0 = 0,; F_1 = 1

    Each Fibonacci number is the sum of the two before it.

  2. F_{2} = F_{1} + F_{0} = 1

  3. F_{3} = F_{2} + F_{1} = 2

  4. F_{4} = F_{3} + F_{2} = 3

  5. F_{5} = F_{4} + F_{3} = 5

  6. F_{6} = F_{5} + F_{4} = 8

  7. F_{7} = F_{6} + F_{5} = 13

  8. F_{8} = F_{7} + F_{6} = 21

  9. \vdots

  10. F_{24} = F_{23} + F_{22} = 46368

  11. F_{25} = F_{24} + F_{23} = 75025

Otkrij odgovor
F_{25} = 75025

Sada ti Izaberite problem, ili upišite ili nacrtajte svoj, svaki korak, slika, odgovor skriven dok ga ne pitate.

Neka tvoja radi.

Besplatni račun dodaje bilješke na svaku lekciju, zapis onoga što ste završili, vaše riješene probleme na jednom mjestu, i tutora kojeg možete pitati o ovoj stranici. Sama matematika je otvorena za svakoga, prijavljenog ili ne.

Prijavite se Prijava

Simboli korišteni ovdje

Dodirnite bilo koji simbol za potpunu definiciju, sliku i što svako slovo u njemu znači.

Kako: Recurrences and generating functions

  1. Each Fibonacci number is the sum of the two before it.

Pitanja koja ljudi postavljaju

Permutation or combination?

Ask whether order matters. A lock code is a permutation (order matters); a hand of cards is a combination (it does not).

What is a graph in this sense?

Dots (vertices) joined by lines (edges), not a plot. Road maps, social networks and molecules are graphs; questions like "is there a route" and "how few colours" are graph theory.

Više u Combinatorics & Graph Theory

The counting principlesPigeonhole principle and inclusion, exclusionBinomial coefficients and Pascal's triangleGraphs: vertices, edges, degreesPaths, cycles, trees, Euler and HamiltonColouring and planar graphs