Closed felixwellen closed 7 months ago
Proves the usual formula for triangular numbers in this form:
(n : fst ℕ) → 2 · (∑ (first (suc n))) ≡ n · (n + 1)
Depends on #1042 #1043 (both merged now)
I just proved this, because I wondered how if it is as little work as I thought it is. Judging from this PR, it looks pleasant, but I actually had to do some refactoring to make it so.
Thanks! Merging when CI is happy.
Proves the usual formula for triangular numbers in this form:
Depends on #1042 #1043 (both merged now)
I just proved this, because I wondered how if it is as little work as I thought it is. Judging from this PR, it looks pleasant, but I actually had to do some refactoring to make it so.