We give an elementary solution to the famous Basel Problem, originally solved by Euler in 1735. We square the well-known series for arctan(1) due to Leibniz, and use a surprising relation among the re-arranged terms of this squared series.

We begin by answering the question, "Which natural numbers are sums of consecutive integers?" We then go on to explore the set of lengths (numbers of summands) in the decompositions of an integer as such sums.

As with natural numbers, a greatest common divisor of two Gaussian (complex) integers "a" and "b" is a Gaussian integer "d" that is a common divisor of both "a" and "b". This article explores an algorithm for such gcds that is easy to do by hand.

Demonstrated is how the concept of equivalence classes modulo n can provide a basis for solving a wide range of problems. Five problems are presented and described to illustrate the power and usefulness of modular arithmetic in problem solving. (MNS)