Akademik Dersler - İçerik

Solve combinatorial problems using the fundamentals of counting.
Explains permutation notion.
Calculates the number of subsets of a given size via binomial coefficient.
Finds number of subsets.
Solve given problems using combinatorial methods.
Use mathematical induction method in proofs.
Use inclusion-exclusion principle.
Solves problems via pigeonhole principle.
Express the properties of binomial coefficients and Pascal's triangle.
Proves the binomial theorem.
Solves various distribution problems.
Express multinomial theorem and its proof.
Express the Fibonacci numbers and their basic properties.
Lists some identities for Fibonacci numbers.
Gives a formula for nth Fibonacci number.
Explain the basic concepts of combinatorial probability.
Express the law of large numbers and the law of small numbers.
Explains integers, divisors and primes.
Express the divisibility of integers.
Explains primes and their history.
Explains factorization into primes.
Proves Fermat's little theorem.
Applies Eucliden algorithm.
Explains how to test whether a number is a prime.
Defines graph and tree notions.
Defines basic concepts of graphs such as vertex, edge, degree of a vertex, etc.
Solves everyday problems via graphs.
Explains Eulerian and Hamiltonian graphs.
Express Cayley theorem.
Explains prüfer code for labelled trees.