조합론

세종대학교
유호석

페이스북 트위터 카카오톡 네이버밴드 링크복사

주제분류

자연과학 >수학ㆍ물리ㆍ천문ㆍ지리 >수학
강의학기

2015년 1학기

조회수

11,303

강의계획서

This course emphasizes combinatorial ideas, including the pigeon-hole principle, counting techniques, permutations. Polya counting, binomial coefficients, inclsion-exclusion principle, generating functions and recurrence relations.

수강안내 및 수강신청
※ 수강확인증 발급을 위해서는 수강신청이 필요합니다

Two basic counting principles

차시별 강의

1.		Two basic counting principles
2.		Two basic counting principles(2) / Simple arrangements and selections
		Simple arrangements and selections with repetitions
3.		Distributions
		Distributions(2)
4.		Distributions(3) / Binomial identities
		Binomial identities(2)
5.		Binomial identities(3) / Calculating coefficients of generating functios
		Calculating coefficients of generating functios(2)
6.		Calculating coefficients of generating functios(3)
		Calculating coefficients of generating functios(4)
7.		Partitions
		Partitions(2)
8.		Exponential generating functions
		Summation method
9.		Recurrence relation models
		Recurrence relation models(2)
10.		Solution of linear recurrence relations / Solution of inhomogeneous recurrence relations
		Solutions with generating functions
11.		Counting with Venn Diagrams
12.		Counting with Venn Diagrams(2)
13.		Inclusion-exclusion formula
		Inclusion-exclusion formula(2)
14.		Restricted positions and rook polynomials
		Pigeonhole Principle - simple form & strong form / Review