A short training organized by the mathematical society of Myanmar (MSM) for senior (Grade 10-11) students qualified for Myanamar national olympiads (now called MOMC). Contents include recurrence relations, recursive algorithms, counting with bijections, and proving combinatorial identities.

  • Lecture notes and slides
    • Recurrence Relations: pdf in Burmese, slides pdf, slides ppt
      Covers the idea of recursion in combinatorics such as setting up recurrences, chromatic polynomials and recursive algorithms such as merge-sort.
    • Bijective Counting: pdf in Burmese (unfinished), slides pdf, slides ppt
      Covers the usage of bijections to solve seemingly complicated counting problems and proving combinatorial identities using counting.
  • Videos: Day 1, Day 2, Day 3.