The sum of the first n odd integers is a square. This is a theorem and can easily be proven if you have already learned **proof by mathematical induction**. Even though it sounds like a boring theorem, it is actually very interesting if represented visually. Consider the following diagrams and their numerical representations.

$latex 1 + 3 = 2^2$

$latex 1 + 3 + 5 = 3^2$

Can you see the pattern? Let’s have some more examples. Continue reading