I thought about some random number-stuff recently and I just summed some odd number and realised that
$\displaystyle\sum_{k=1}^{n}2k-1=n^2$ for $n\in\mathbb{N}^+$
I was wondering how you'd prove this and why this holds true.
I thought about some random number-stuff recently and I just summed some odd number and realised that
$\displaystyle\sum_{k=1}^{n}2k-1=n^2$ for $n\in\mathbb{N}^+$
I was wondering how you'd prove this and why this holds true.
$$\begin{aligned}{} \color{blue}{\Rule{10mm}{10mm}{1mm}} \color{blue}{\Rule{10mm}{10mm}{1mm}} \color{blue}{\Rule{10mm}{10mm}{1mm}}\[-1em] \color{red}{\Rule{10mm}{10mm}{1mm}} \color{red}{\Rule{10mm}{10mm}{1mm}} \color{blue}{\Rule{10mm}{10mm}{1mm}}\[-1em] \color{black}{\Rule{10mm}{10mm}{0mm}} \color{red}{\Rule{10mm}{10mm}{0mm}} \color{blue}{\Rule{10mm}{10mm}{0mm}} \end{aligned} $$
– Vepir Oct 05 '21 at 12:39