A typical question in combinatorics asks how many types of something exist, yet what is meant is how many distinct types exist. Avoiding counting duplicates can be tricky because two equivalent objects may not appear equivalent at first, such as swapping several rows in a Sudoku puzzle. Burnside's lemma provides a simple way of counting such distinct objects by using elementary group theory. In this talk, I'll show how this method can be applied to counting problems by working a few examples, and then we'll see how Polya enumeration simplifies and generalizes these calculations. A benefit of attending is amazing your family and friends with the useful(!) math you'll learn.