-- level: 2 import Mathlib /-! Prove that the sum of the first $n$ odd numbers is $n^2$: $1 + 3 + \cdots + (2n-1) = n^2$. -/ theorem sum_of_odds (n : ℕ) : ∑ i ∈ Finset.range n, (2 * i + 1) = n ^ 2 := by sorry