turkmath.org

In this talk, we will define integer partitions, and begin with a 250+ years old theorem by Euler. The theorem asserts that the number of ways to break down a positive integer into a sum of distinct positive parts equals the number of ways to break it down into positive odd parts. Then, we will follow a subsequent line of development, and will try to write generating functions for various types o partitions by the help of a few pebbles, as well as give historical information on the mentioned results. As time allows, we will talk about the Rogers - Ramanujan - Gordon and Andrews - Gordon identities.