Theorems · Theorem · number theory
Nat.Prime.emultiplicity_choose
∀ {p n k b : ℕ},
Nat.Prime p →
k ≤ n →
Nat.log p n < b → emultiplicity p (n.choose k) = ↑{i ∈ Finset.Ico 1 b | p ^ i ≤ k % p ^ i + (n - k) % p ^ i}.cardThe multiplicity of p in choose n k is the number of carries when k and n - k
are added in base p. The set is expressed by filtering Ico 1 b where b
is any bound greater than log p n.
- Defined in
- Mathlib.Data.Nat.Multiplicity
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 86 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- ENatstatement and proof · cited by 4,985
- Monoidproof · cited by 3,887
- Finset.cardstatement and proof · cited by 2,327
- Nat.Primestatement and proof · cited by 2,059
- Finset.filterstatement and proof · cited by 949
- Nat.choosestatement and proof · cited by 494
- Finset.Icostatement and proof · cited by 450
- emultiplicitystatement and proof · cited by 156
- Nat.logstatement and proof · cited by 101
- Nat.Prime.emultiplicity_choose'proof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Nat.Prime.emultiplicity_choose_prime_pow_add_emultiplicityproof · cited by 2
- padicValNat_chooseproof · cited by 0