Glaisher's theorem on partitions
ProvedFamousTheorems.glaisherGlaisher's theorem. For every and , the number of partitions of with no part divisible by equals the number of partitions of in which no part appears or more times.
For this is Euler's theorem (odd parts ↔ distinct parts). Glaisher's bijection (split a part into copies of ) generalises Euler's, and the generating-function proof is the identity read in two ways.
Formalization note. Mathlib's Nat.Partition.card_restricted_eq_card_countRestricted: restricted n P is the finset of partitions of n whose parts satisfy P, and countRestricted n m those with every multiplicity < m.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem glaisher (n : ℕ) {m : ℕ} (hm : 0 < m) :
(Nat.Partition.restricted n fun x => ¬ m ∣ x).card = (Nat.Partition.countRestricted n m).card := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Nat.Partition.card_restricted_eq_card_countRestricted`. Proof here reduces to that Mathlib result.