Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Sum of integers below 765

Proved
FiniteTriangular.sum_range_765

by carlok · Sep 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

arithmeticfinite-sum

The sum of the nonnegative integers strictly less than 765765765 equals 292230292230292230. Equivalently, sumk=0765−1k=765(765−1)/2\\sum_{k=0}^{765-1} k = 765(765-1)/2sumk=0765−1​k=765(765−1)/2.

Preamble
import Mathlib
open Finset
Formal statement
namespace FiniteTriangular

theorem sum_range_765 : ∑ k ∈ range 765, k = 292230 := by sorry

end FiniteTriangular
Source
Elementary arithmetic series: the sum of the first m positive integers is m(m+1)/2, rewritten on Finset.range.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me