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.

Δουλεμένο παράδειγμα · fib(25)

Number-Theory · Sequences

Fib(25)

25

Βήμα προς βήμα

  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

Αποκάλυψέ την.
F_{25} = 75025

Τώρα εσύ. Επιλέξτε ένα πρόβλημα, ή πληκτρολογήστε ή σχεδιάστε το δικό σας.

Να δουλεύεις μόνος σου.

Ένας δωρεάν λογαριασμός προσθέτει σημειώσεις σε κάθε μάθημα, ένα αρχείο του τι έχετε τελειώσει, λύθηκαν προβλήματα σας σε ένα μέρος, και ένας δάσκαλος που μπορείτε να ρωτήσετε για αυτή τη σελίδα.

Υπογράψτε Σύνδεση

Σύμβολα που χρησιμοποιούνται εδώ

Χτυπήστε οποιοδήποτε σύμβολο για τον πλήρη ορισμό, μια εικόνα, και τι σημαίνει κάθε γράμμα σε αυτό.

Πώς να: Recurrences and generating functions

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

Ερωτήσεις που κάνουν οι άνθρωποι

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.

Περισσότερα σε 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