The theory surrounding representations of the symmetric group is an interesting topic to study since it can be approached from several different areas of mathematics. The symmetric group of degree n (which we call Sn) can be viewed as the set of all permutations of the ordered sequence of numbers { 1, 2, …, n}. For example, with this interpretation the symmetric group of order three is the set:(1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), and (3,2,1). Looking at the representation theory of the symmetric group means that we are looking at how we might translate the action of elements of this group into the language of linear algebra. It turns out that there are a finite number of irreducible “translations” (which we call representations) and that each of these can be in turn associated with a set of numbers called characters. Most of the above is traditionally studied using an area of mathematics called abstract algebra. However, one can also approach this subject using a newer area of math called combinatorics, which among other things studies the number of ways that we may count different arrangements of objects in a set. In fact, using a combinatorial algorithm called the Murnaghan Nakayama rule, we can easily generate the character table of Sn, for any n, without reference to abstract algebra or representation theory. In my project, I have been looking at ways of using combinatorics and the Murnaghan-Nakayama rule to prove certain properties about the row sums in the character table of Sn.