Talk #1: Jason Hou, University of Waterloo
"Sieve methods in combinatorics"
In this talk, I will give a formulation for the Turán sieve and a 'simple sieve' in the context of bipartite graphs and apply it to a graph colouring problem.
Talk #2: Adam Jelinsky, University of Waterloo
"Properties of the Pseudo-randomness of a³ mod p²"
In this talk, I will be discussing methods and tactics used to quantify and understand the apparent pseudo-random distribution of a³ mod p², the evidence we have to fit the random model proposed, and the required steps in order to formally prove it.