Time: 3-3:50 p.m.
Place: MB 124
Jason Smith, Boise State University
Title: Using graphs to count
Abstract: By counting triangles in complete graphs and edges in complete bipartite graphs we give combinatorial proofs for identities for sums of the first n positive integers, square integers, and cubed integers. An open problem will be given. Time permitting purely combinatorial proofs for these identities will also be given.