nat_divisors_card_1248191226
The number of divisors of 1248191226 is 36.
Statement
theorem nat_divisors_card_1248191226 : (Nat.divisors 1248191226).card = 36- Source
- step towards op_652_half_degree_packing_negation
- Verified
- 30 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext
The proof, explained
The integer 1248191226 is factored as 18 * 37^5. Since 18 and 37^5 are coprime, the number of divisors of their product is the product of their respective divisor counts. Because 37 is prime, 37^5 has 5 + 1 = 6 divisors, and 18 has 6 divisors by direct enumeration. Multiplying these counts gives 6 * 6 = 36 divisors in total.
1248191226 is factored as 18 * 37^5.
The numerical identity 1248191226 = 18 * 37^5 is verified by direct calculation using norm_num, allowing 1248191226 to be replaced by 18 * 37^5 in the goal.
rw [show 1248191226 = 18 * 37 ^ 5 by norm_num]
The number of divisors of 18 * 37^5 is the product of the number of divisors of 18 and the number of divisors of 37^5.
Since 18 and 37^5 are coprime (verified by decide), the divisor counting function is multiplicative across this product by Nat.Coprime.card_divisors_mul.
uses
Nat.Coprime.card_divisors_mulrw [Nat.Coprime.card_divisors_mul (by decide)]
The prime power 37^5 has 6 divisors.
Because 37 is prime (verified by norm_num), Nat.divisors_prime_pow shows that the divisors of 37^5 are precisely the powers 37^0, 37^1, ..., 37^5. Simplifying the cardinality of this set of 5 + 1 elements with simp proves that 37^5 has 6 divisors.
uses
Nat.divisors_prime_powhave h37 : (Nat.divisors (37 ^ 5)).card = 6 := by rw [Nat.divisors_prime_pow (by norm_num : Nat.Prime 37)] simp
The number 18 has 6 divisors.
A finite computation via decide enumerates the divisors of 18 (namely 1, 2, 3, 6, 9, 18) and confirms that there are 6 of them.
have h18 : (Nat.divisors 18).card = 6 := by decide
The total number of divisors of 1248191226 is 36.
Rewriting with the two evaluated counts replaces the divisor counts of 37^5 and 18 with 6, leaving 6 * 6 = 36, which finishes the proof.
rw [h37, h18]
Nat.Coprime.card_divisors_mul- If two natural numbers m and n are coprime, then the number of positive divisors of their product m * n equals the product of the number of divisors of m and the number of divisors of n.
Nat.divisors_prime_pow- For any prime p and natural number k, the divisors of p^k are exactly the powers p^0, p^1, ..., p^k.
- After substituting the values into the product, the rewrite tactic in line 9 automatically closes the resulting equality 6 * 6 = 36 by reflexivity.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The number of positive divisors of 1248191226 = 18 * 37^5 is 36. -/theorem nat_divisors_card_1248191226 : (Nat.divisors 1248191226).card = 36 := by rw [show 1248191226 = 18 * 37 ^ 5 by norm_num] rw [Nat.Coprime.card_divisors_mul (by decide)] have h37 : (Nat.divisors (37 ^ 5)).card = 6 := by rw [Nat.divisors_prime_pow (by norm_num : Nat.Prime 37)] simp have h18 : (Nat.divisors 18).card = 6 := by decide rw [h37, h18]