Scribd
Upload
70 views

CN C0Cn 1 + C1Cn 2 + +CN 2C1 + CN 1C0 Is A Recursive Definition

This document provides summaries of various topics in mathematics: - Generating functions and the extended binomial theorem for expressing polynomials in terms of coefficients. - Catalan numbers which count parenthesized expressions and paths in a square grid that never rise above the diagonal. - Linear homogeneous recurrence relations and their solutions. - The Chinese remainder theorem for solving systems of congruences. - Fermat's little theorem and its applications. - Graph theory concepts including isomorphic graphs, paths, circuits, cut vertices/edges, and conditions for Euler and Hamilton paths/circuits.

Uploaded by

Thomas Cai
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
70 views

CN C0Cn 1 + C1Cn 2 + +CN 2C1 + CN 1C0 Is A Recursive Definition

This document provides summaries of various topics in mathematics: - Generating functions and the extended binomial theorem for expressing polynomials in terms of coefficients. - Catalan numbers which count parenthesized expressions and paths in a square grid that never rise above the diagonal. - Linear homogeneous recurrence relations and their solutions. - The Chinese remainder theorem for solving systems of congruences. - Fermat's little theorem and its applications. - Graph theory concepts including isomorphic graphs, paths, circuits, cut vertices/edges, and conditions for Euler and Hamilton paths/circuits.

Uploaded by

Thomas Cai
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Generating functions: Some nice formulas on pg.

543, most important is 1/1-ax= 1+ax+(ax)^2…

Extended binomial theorem:C(u,k)= u(u-1)(u-2)…(u-k+1)/k! Notably, C(-n,k)=((-1)^k)C(n+k-1,k) . then, we


have (1+x)^u = sum 0 to infinity of C(u,k) x^k

Catalan numbers: C(2n,n)/(n+1) = number of ways to parenthesize n+1 numbers. Another interpretation
is the number of paths in an nxn square that never go above the diagonal, with only right and up moves.
Another is w/ 2n people in a circle, how many ways are there to shake hands w/out hands bumping If
you’re stuck on some counting problem, see if the catalan numbers save you.

Cn = C0Cn− 1 + C1Cn− 2 +· · ·+Cn− 2C1 + Cn− 1C0 is a recursive definition

A linear homogenous recurrence is a recurrence with only constants times previous terms. I fit’s this,
y’know what to do. If there’s a function attached, guess a particular solution of similar form.
Chinese remainder theorem: There exists a solution to a system like 2 mod 3 3 mod 5 2 mod 7, mod
3x5x7, as long as it follows some conditions you’ll be sure to catch if they aren’t met. Furthermore, the
solution can be found by taking M = 3x5x7. M1= 5x7, find the inverse mod 3, call that y1. Multiply by
a1, the thing before the mod, so 2. Repeat for the rest and add them up. Write this better on paper.
Fermat’s little theorem, a^p congruent to a mod p.
Euclidena algorithm, worth? Well if I have space I’ll take it. “Ladder climbing” is possibly mas important
Wilson’s theorem. A number is prime iff (n-1)! = -1 mod n. Proof: 1 is its own inverse.Everyone else has
a unique inverse, which it can be paired up with, except n-1, because it’s its own inverse.
Fun fact: n-1 is its own inverse mod n
Ramsey numbers: friends not friends thing R(3,4) is the min that needs either 3 friends or 4 enemies.
Graphs: G(V,E) can be a thing (vertices, edges) incident means connecting, neighborhood is just vertices
connected to a vertex or set of vertices degree is number of edges connected to a vertex.
Special graphs: Kn stands for Komplete graph, Cn for cycle, Wn for wheel (like a cycle, except you stick
a new vertex in the middle and connect it to all of them. Note that W3 has 4 vertices. Qn for Qube, where
they rep. bit strings and are connected if they differ in exactly one place.
Bipartite= can be split into two groups, which don’t connect within themselves.
Hall’s marriage: given v1 & v2 are bipartite, it is complete, meaning that all valid connections are made,
iff the cardinality of the neighborhood of any set within a group is greater than or equal to the cardinality
of the group.
Graphs are isomorphic if they have the same connections in the same way. You can figure out what this
means.
A path is just a thing that goes through vertices. A cycle/circuit ends up at the starting place. A graph is
connected if you can make a path between any two vertices. A simple path doesn’t double traverse edges.
Cut vertices/edges are ones that if you remove them split the graph. Vertex/edge connectivity is the min.
vertices/edges needed to be removed to break the graph.
An Euler path/circuit is one that touches all edges of the graph exactly once. Iff every single vertex has
even degree, an Euler circuit exists. If there are exactly two vertices with odd degree, we have a path.
Otherwise, we got nothing.
A Hamilton path/circuit is one that contains every vertex once.
Not much info, but there’s this:
ORE’S THEOREM If G is a simple graph with n vertices with n ≥ 3 such that

deg(u) + deg(v) ≥ n for every pair of nonadjacent vertices u and v in G, then G has a

Hamilton circuit.

A special case is

DIRAC’S THEOREM If G is a simple graph with n vertices with n ≥ 3 such that the

degree of every vertex in G is at least n/2, then G has a Hamilton circuit.

You might also like