Theorems · Theorem · number theory
Polynomial.sum_bernoulli
∀ (n : ℕ), ∑ k ∈ Finset.range (n + 1), ↑((n + 1).choose k) • Polynomial.bernoulli k = (Polynomial.monomial n) (↑n + 1)
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 164 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites36
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- RingHom.idstatement · cited by 18,349
- LinearMapstatement · cited by 10,215
- Polynomialstatement and proof · cited by 5,681
- Finset.sumstatement and proof · cited by 5,195
- mul_oneproof · cited by 3,885
- Nat.cast_oneproof · cited by 2,501
- zero_addproof · cited by 2,366
- Finset.sum_congrproof · cited by 2,323
- mul_commproof · cited by 2,262
- mul_assocproof · cited by 1,667
- one_smulproof · cited by 1,374
Cited by2
Results whose statement or proof uses this declaration.
- Polynomial.bernoulli_eq_sub_sumproof · cited by 1
- Polynomial.bernoulli_generating_functionproof · cited by 0