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.

Apstrādāts piemērs · fib(25)

Number-Theory · Sequences

Fib(25)

25

Solis pēc kārtas

  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

Atbildēt uz šo jautājumu
F_{25} = 75025

Tagad tu Izvēlieties problēmu, vai ierakstiet vai zīmējiet savu. Katrs solis, attēls, atbilde slēpta, līdz jūs lūgt.

Saglabāt savu darbu

Bezmaksas konts pievieno piezīmes par katru nodarbību, ierakstu par to, ko esat pabeidzis, jūsu atrisinātās problēmas vienā vietā, un pasniedzēju, kuru varat jautāt par šo lapu. Pati matemātika ir pieejama ikvienam, kas ir vai nav parakstījies.

Pierakstīties Pieteikšanās

Šeit izmantotie simboli

Piesitiet visiem simboliem, kas apzīmē pilnu definīciju, attēlu un ko katrs burts tajā nozīmē.

Kā lietot: Recurrences and generating functions

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

Jautājumi, ko cilvēki vaicā

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.

Vairāk 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