AFTD Auto-Formalizing Theoretical Domains

designated_partition_six_tuple_twenty_two_divisible_by_243

theoremverified

The number of designated partition 6-tuples of size 22, designated_partition_k_tuple 6 22, is divisible by 243.

Statement

theorem designated_partition_six_tuple_twenty_two_divisible_by_243 :
    243 ∣ designated_partition_k_tuple 6 22
Source
arXiv:2611.05623 Conjecture 6.3
Verified
09 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5

Read back from the Lean

243 divides designated_partition_k_tuple 6 22, which is the coefficient of $X^{22}$ in the 6th power of the designated partition generating function designated_partition_gen_fun.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

The proof, explained

The number of designated partition 6-tuples of size 22 is given by the 22nd coefficient of the 6th power of the partition generating function F. Because only terms of degree at most 22 can contribute to this coefficient, the infinite product F is truncated to its first 23 factors without affecting any power's degree-22 coefficient. Truncated list convolutions are shown to faithfully compute power series products and powers, reducing the coefficient to the 22nd entry of a concrete list `pwList 23 6 23`. Lean's kernel evaluates this entry to 6,635,911,068 via `decide`, and numeric verification confirms it is divisible by 243.

  1. Reading the `k`-th element of `(List.range L).map f` for `k < L` yields `f k`.

    We rewrite `List.getD` into an optional lookup with `List.getD_eq_getElem?_getD`, distribute it over the map with `List.getElem?_map`, and simplify the lookup in `List.range L` using `List.getElem?_range hk` to obtain `f k` by reflexivity.

    lines 36–38

    uses List.getD_eq_getElem?_getD, List.getElem?_map, List.getElem?_range

        ((List.range L).map f).getD k 0 = f k := by
      rw [List.getD_eq_getElem?_getD, List.getElem?_map, List.getElem?_range hk]
      rfl
  2. For `k < L`, the `k`-th entry of `oneList L` equals the `k`-th coefficient of the constant power series 1.

    Unfolding `oneList` and evaluating via `designated_partition_six_tuple_twenty_two_divisible_by_243_list_getD_map_range`, the list entry is 1 when `k = 0` and 0 otherwise. A case split on `k = 0` or `k > 0` using `Nat.eq_zero_or_pos` shows that both sides evaluate to 1 when `k = 0`, and both evaluate to 0 when `k > 0` by `if_neg` and `PowerSeries.coeff_one`.

    lines 44–51

    uses designated_partition_six_tuple_twenty_two_divisible_by_243_list_getD_map_range, Nat.eq_zero_or_pos, if_neg, PowerSeries.coeff_one

          PowerSeries.coeff k (1 : PowerSeries ℕ) := by
      simp only [designated_partition_six_tuple_twenty_two_divisible_by_243_oneList,
        designated_partition_six_tuple_twenty_two_divisible_by_243_list_getD_map_range _ L k hk]
      rcases Nat.eq_zero_or_pos k with hk0 | hk0
      · subst hk0; simp
      · rw [if_neg (by omega)]
        exact (PowerSeries.coeff_one (R := ℕ) k).trans (if_neg (by omega)) |>.symm
    
  3. Truncated list convolution `conv L a b` computes the coefficients of the Cauchy product `φ * ψ` below degree `L`.

    Unfolding `conv` and evaluating at index `k < L` yields the sum `∑ i ∈ range (k + 1), a[i] * b[k - i]`. By `designated_partition_six_tuple_ten_mod_243_coeff_mul_range`, the `k`-th coefficient of `φ * ψ` is the corresponding sum of products of coefficients. Applying `Finset.sum_congr` reduces the equality to each summand, where the hypotheses `ha` and `hb` apply since `i < L` and `k - i < L` by linear arithmetic.

    lines 74–83

    uses designated_partition_six_tuple_twenty_two_divisible_by_243_list_getD_map_range, designated_partition_six_tuple_ten_mod_243_coeff_mul_range, Finset.sum_congr, Finset.mem_range

            PowerSeries.coeff k (φ * ψ) := by
      intro k hk
      rw [designated_partition_six_tuple_twenty_two_divisible_by_243_conv,
        designated_partition_six_tuple_twenty_two_divisible_by_243_list_getD_map_range _ L k hk,
        designated_partition_six_tuple_ten_mod_243_coeff_mul_range]
      apply Finset.sum_congr rfl
      intro i hi
      rw [Finset.mem_range] at hi
      rw [ha i (by omega), hb (k - i) (by omega)]
    
  4. For all `j`, `pvList j L` computes the first `L` coefficients of the partial product of the first `j` factor power series.

    By induction on `j`. When `j = 0`, the empty product is 1 (`Finset.range_zero`, `Finset.prod_empty`), matching `oneList L` by `designated_partition_six_tuple_twenty_two_divisible_by_243_oneList_spec`. For the induction step, `pvList (j + 1) L` convolves `pvList j L` with `facList (j + 1) L`; `designated_partition_six_tuple_twenty_two_divisible_by_243_conv_spec` applies via the induction hypothesis and factor lemmas (`facList_getD`, `facVal_coeff`), and `Finset.prod_range_succ` splits the product.

    lines 89–106

    uses Finset.range_zero, Finset.prod_empty, designated_partition_six_tuple_twenty_two_divisible_by_243_oneList_spec, designated_partition_six_tuple_twenty_two_divisible_by_243_conv_spec, designated_partition_six_tuple_twenty_two_divisible_by_243_facList_getD, designated_partition_six_tuple_twenty_two_divisible_by_243_facVal_coeff, Finset.prod_range_succ

              designated_partition_six_tuple_ten_mod_243_fac (i + 1)) := by
      induction j with
      | zero =>
        intro L k hk
        simp only [designated_partition_six_tuple_twenty_two_divisible_by_243_pvList,
          Finset.range_zero, Finset.prod_empty]
        exact designated_partition_six_tuple_twenty_two_divisible_by_243_oneList_spec L k hk
      | succ j ih =>
        intro L k hk
        simp only [designated_partition_six_tuple_twenty_two_divisible_by_243_pvList]
        rw [designated_partition_six_tuple_twenty_two_divisible_by_243_conv_spec L _ _ _ _
          (fun i hi => ih L i hi)
          (fun i hi =>
            (designated_partition_six_tuple_twenty_two_divisible_by_243_facList_getD (j+1) L i hi).trans
              (designated_partition_six_tuple_twenty_two_divisible_by_243_facVal_coeff (j+1) (by omega) i).symm)
          k hk]
        rw [Finset.prod_range_succ]
    
  5. For all powers `m`, `pwList M m L` computes the first `L` coefficients of the `m`-th power of the `M`-factor product.

    By induction on `m`. The base case `m = 0` simplifies to the constant 1 by `pow_zero`, matching `oneList L`. In the induction step, `pwList M (m + 1) L` convolves `pwList M m L` with `pvList M L`; applying `designated_partition_six_tuple_twenty_two_divisible_by_243_conv_spec` with the induction hypothesis and `designated_partition_six_tuple_twenty_two_divisible_by_243_pvList_spec` represents multiplication by the base factor, which matches `pow_succ`.

    lines 112–126

    uses pow_zero, designated_partition_six_tuple_twenty_two_divisible_by_243_oneList_spec, designated_partition_six_tuple_twenty_two_divisible_by_243_conv_spec, designated_partition_six_tuple_twenty_two_divisible_by_243_pvList_spec, pow_succ

              designated_partition_six_tuple_ten_mod_243_fac (i + 1)) ^ m) := by
      induction m with
      | zero =>
        intro L k hk
        simp only [designated_partition_six_tuple_twenty_two_divisible_by_243_pwList, pow_zero]
        exact designated_partition_six_tuple_twenty_two_divisible_by_243_oneList_spec L k hk
      | succ m ih =>
        intro L k hk
        simp only [designated_partition_six_tuple_twenty_two_divisible_by_243_pwList]
        rw [designated_partition_six_tuple_twenty_two_divisible_by_243_conv_spec L _ _ _ _
          (fun i hi => ih L i hi)
          (fun i hi => designated_partition_six_tuple_twenty_two_divisible_by_243_pvList_spec M L i hi)
          k hk]
        rw [pow_succ]
    
  6. For all `k ≤ 22`, the `k`-th coefficient of the generating function equals that of the product of the first 23 factors.

    By `designated_partition_six_tuple_ten_mod_243_coeff_gen_fun`, the `k`-th coefficient of the full generating function equals that of the partial product of the first `k + 1` factors. Since `k + 1 ≤ 23`, the stabilization lemma `designated_partition_six_tuple_ten_mod_243_coeff_prod_range_stab` shows that adding factors up to 23 does not alter the `k`-th coefficient.

    lines 132–135

    uses designated_partition_six_tuple_ten_mod_243_coeff_gen_fun, designated_partition_six_tuple_ten_mod_243_coeff_prod_range_stab, le_rfl

            designated_partition_six_tuple_ten_mod_243_fac (i + 1)) := by
      rw [designated_partition_six_tuple_ten_mod_243_coeff_gen_fun k,
        (designated_partition_six_tuple_ten_mod_243_coeff_prod_range_stab k 23 (by omega) k (le_rfl)).symm]
    
  7. For all powers `m` and degrees `k ≤ 22`, the `k`-th coefficient of `(gen_fun)^m` matches that of the 23-factor truncation.

    By induction on `m`. The base case `m = 0` is trivial as both sides equal 1. For `m + 1`, we expand the powers using `pow_succ` and express their `k`-th coefficients as Cauchy convolutions using `designated_partition_six_tuple_ten_mod_243_coeff_mul_range`. `Finset.sum_congr` matches the summands term by term, applying the induction hypothesis to index `i ≤ 22` and `designated_partition_six_tuple_twenty_two_divisible_by_243_coeff_gen_fun_eq` to index `k - i ≤ 22`.

    lines 141–153

    uses pow_succ, designated_partition_six_tuple_ten_mod_243_coeff_mul_range, Finset.sum_congr, Finset.mem_range, designated_partition_six_tuple_twenty_two_divisible_by_243_coeff_gen_fun_eq

              designated_partition_six_tuple_ten_mod_243_fac (i + 1)) ^ m) := by
      induction m with
      | zero => intro k hk; simp
      | succ m ih =>
        intro k hk
        rw [pow_succ, pow_succ,
          designated_partition_six_tuple_ten_mod_243_coeff_mul_range,
          designated_partition_six_tuple_ten_mod_243_coeff_mul_range]
        apply Finset.sum_congr rfl
        intro i hi
        rw [Finset.mem_range] at hi
        rw [ih i (by omega), designated_partition_six_tuple_twenty_two_divisible_by_243_coeff_gen_fun_eq (k - i) (by omega)]
    
  8. The divisibility goal `243 ∣ designated_partition_k_tuple 6 22` reduces to showing that 243 divides the 22nd entry of `pwList 23 6 23`.

    By definition, the number of designated partition 6-tuples of size 22 is the 22nd coefficient of `(gen_fun)^6`. Applying `designated_partition_six_tuple_twenty_two_divisible_by_243_pow_coeff_eq` replaces this with the 22nd coefficient of the 6th power of the 23-factor truncation. Then `designated_partition_six_tuple_twenty_two_divisible_by_243_pwList_spec` equates that coefficient to the 22nd entry of the computable list `pwList 23 6 23`.

    lines 156–159

    uses designated_partition_six_tuple_twenty_two_divisible_by_243_pow_coeff_eq, designated_partition_six_tuple_twenty_two_divisible_by_243_pwList_spec

        243 ∣ designated_partition_k_tuple 6 22 := by
      show 243 ∣ PowerSeries.coeff 22 (designated_partition_gen_fun ^ 6)
      rw [designated_partition_six_tuple_twenty_two_divisible_by_243_pow_coeff_eq 6 22 (by norm_num)]
      rw [← designated_partition_six_tuple_twenty_two_divisible_by_243_pwList_spec 23 6 23 22 (by norm_num)]
  9. The 22nd entry of `pwList 23 6 23` is 6,635,911,068, which is divisible by 243. automation

    Lean's kernel evaluates the concrete list operations using `decide` to prove that the 22nd entry of `pwList 23 6 23` is 6,635,911,068. Substituting this value into the divisibility goal, `norm_num` verifies that 243 divides 6,635,911,068 (since 6635911068 = 243 × 27308276).

    lines 160–162

      have hval : (designated_partition_six_tuple_twenty_two_divisible_by_243_pwList 23 6 23).getD 22 0 = 6635911068 := by decide
      rw [hval]
      norm_num
List.getD_eq_getElem?_getD
Reading an element from a list with a default fallback equals performing an optional index lookup and unpacking with the default value.
List.getElem?_map
An optional element lookup at index `i` in a mapped list `List.map f l` is the function `f` applied to the optional lookup in `l`.
List.getElem?_range
For `i < n`, the optional lookup at index `i` in `List.range n` yields `some i`.
designated_partition_six_tuple_twenty_two_divisible_by_243_list_getD_map_range
For index `k < L`, the `k`-th element of `List.range L` mapped by `f` equals `f k`.
Nat.eq_zero_or_pos
Every natural number is either equal to 0 or strictly positive.
if_neg
An if-then-else expression evaluates to its else-branch when the condition is false.
PowerSeries.coeff_one
The `n`-th coefficient of the constant power series 1 is 1 when `n = 0` and 0 when `n ≠ 0`.
designated_partition_six_tuple_ten_mod_243_coeff_mul_range
The `n`-th coefficient of the product of two power series is the Cauchy convolution sum of their coefficients up to degree `n`.
Finset.sum_congr
Two finite sums are equal if their index sets are identical and their summands agree on every element.
Finset.mem_range
A natural number belongs to `Finset.range n` if and only if it is strictly less than `n`.
Finset.range_zero
The range of length 0 is the empty set.
Finset.prod_empty
The product of any function over the empty set is 1.
designated_partition_six_tuple_twenty_two_divisible_by_243_oneList_spec
For `k < L`, the `k`-th entry of `oneList L` matches the `k`-th coefficient of the power series 1.
designated_partition_six_tuple_twenty_two_divisible_by_243_conv_spec
Truncated list convolution up to length `L` correctly computes the coefficients of the Cauchy product of two power series below degree `L`.
designated_partition_six_tuple_twenty_two_divisible_by_243_facList_getD
For `k < L`, the `k`-th element of `facList i L` equals `facVal i k`.
designated_partition_six_tuple_twenty_two_divisible_by_243_facVal_coeff
For `i ≠ 0`, `facVal i e` is the `e`-th coefficient of the factor power series `fac i`.
Finset.prod_range_succ
A product over `Finset.range (n + 1)` equals the product over `range n` multiplied by the `n`-th term.
pow_zero
Any monoid element raised to the zeroth power equals 1.
designated_partition_six_tuple_twenty_two_divisible_by_243_pvList_spec
For `k < L`, the `k`-th element of `pvList j L` equals the `k`-th coefficient of the partial product of the first `j` factor power series.
pow_succ
Raising an element to power `n + 1` equals multiplying its `n`-th power by the element.
designated_partition_six_tuple_ten_mod_243_coeff_gen_fun
The `d`-th coefficient of the full designated partition generating function equals the `d`-th coefficient of the product of its first `d + 1` factors.
designated_partition_six_tuple_ten_mod_243_coeff_prod_range_stab
For any `k ≤ d`, the `k`-th coefficient of the factor product stabilizes once at least `d + 1` factors are included in the product.
le_rfl
The preorder relation `≤` is reflexive.
designated_partition_six_tuple_twenty_two_divisible_by_243_coeff_gen_fun_eq
For all `k ≤ 22`, the `k`-th coefficient of the designated partition generating function matches that of the product of the first 23 factors.
designated_partition_six_tuple_twenty_two_divisible_by_243_pow_coeff_eq
For any power `m` and degree `k ≤ 22`, the `k`-th coefficient of the `m`-th power of the generating function matches that of the 23-factor truncation.
designated_partition_six_tuple_twenty_two_divisible_by_243_pwList_spec
For `k < L`, `pwList M m L` computes the `k`-th coefficient of the `m`-th power of the product of the first `M` factors.

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

open Finset PowerSeries/-- Explicit value of the coefficient of `fac i` at degree `e`. -/def designated_partition_six_tuple_twenty_two_divisible_by_243_facVal (i e : ℕ) : ℕ :=  if e = 0 then 1 else if i ∣ e then e / i else 0/-- The first `L` coefficients of `fac i`, as a list. -/def designated_partition_six_tuple_twenty_two_divisible_by_243_facList (i L : ℕ) : List ℕ :=  (List.range L).map (designated_partition_six_tuple_twenty_two_divisible_by_243_facVal i)/-- The first `L` coefficients of the constant power series 1. -/def designated_partition_six_tuple_twenty_two_divisible_by_243_oneList (L : ℕ) : List ℕ :=  (List.range L).map (fun k => if k = 0 then 1 else 0)/-- Truncated convolution of two coefficient lists up to degree `L-1`. -/def designated_partition_six_tuple_twenty_two_divisible_by_243_conv (L : ℕ) (a b : List ℕ) : List ℕ :=  (List.range L).map fun k => ∑ i ∈ Finset.range (k+1), a.getD i 0 * b.getD (k - i) 0/-- Coefficients of the partial products `∏ (i+1) ≤ j, fac (i+1)`. -/def designated_partition_six_tuple_twenty_two_divisible_by_243_pvList : ℕ → ℕ → List ℕ  | 0, L => designated_partition_six_tuple_twenty_two_divisible_by_243_oneList L  | j+1, L => designated_partition_six_tuple_twenty_two_divisible_by_243_conv L      (designated_partition_six_tuple_twenty_two_divisible_by_243_pvList j L)      (designated_partition_six_tuple_twenty_two_divisible_by_243_facList (j+1) L)/-- Coefficients of the `m`-th power of the truncated product of the first `M` factors. -/def designated_partition_six_tuple_twenty_two_divisible_by_243_pwList (M : ℕ) : ℕ → ℕ → List ℕ  | 0, L => designated_partition_six_tuple_twenty_two_divisible_by_243_oneList L  | m+1, L => designated_partition_six_tuple_twenty_two_divisible_by_243_conv L      (designated_partition_six_tuple_twenty_two_divisible_by_243_pwList M m L)      (designated_partition_six_tuple_twenty_two_divisible_by_243_pvList M L)/-- Reading the `k`-th entry below `L` from a mapped `List.range`. -/lemma designated_partition_six_tuple_twenty_two_divisible_by_243_list_getD_map_range    (f : ℕ → ℕ) (L k : ℕ) (hk : k < L) :    ((List.range L).map f).getD k 0 = f k := by  rw [List.getD_eq_getElem?_getD, List.getElem?_map, List.getElem?_range hk]  rfl/-- The one list represents the coefficients of `1`. -/lemma designated_partition_six_tuple_twenty_two_divisible_by_243_oneList_spec    (L k : ℕ) (hk : k < L) :    (designated_partition_six_tuple_twenty_two_divisible_by_243_oneList L).getD k 0 =      PowerSeries.coeff k (1 : PowerSeries ℕ) := by  simp only [designated_partition_six_tuple_twenty_two_divisible_by_243_oneList,    designated_partition_six_tuple_twenty_two_divisible_by_243_list_getD_map_range _ L k hk]  rcases Nat.eq_zero_or_pos k with hk0 | hk0  · subst hk0; simp  · rw [if_neg (by omega)]    exact (PowerSeries.coeff_one (R := ℕ) k).trans (if_neg (by omega)) |>.symm/-- The fac list gives the explicit factor coefficients. -/lemma designated_partition_six_tuple_twenty_two_divisible_by_243_facList_getD    (i L k : ℕ) (hk : k < L) :    (designated_partition_six_tuple_twenty_two_divisible_by_243_facList i L).getD k 0 =      designated_partition_six_tuple_twenty_two_divisible_by_243_facVal i k :=  designated_partition_six_tuple_twenty_two_divisible_by_243_list_getD_map_range    (designated_partition_six_tuple_twenty_two_divisible_by_243_facVal i) L k hk/-- `facVal i e` is the coefficient of `fac i` at degree `e`. -/lemma designated_partition_six_tuple_twenty_two_divisible_by_243_facVal_coeff    (i : ℕ) (hi : i ≠ 0) (e : ℕ) :    (PowerSeries.coeff e) (designated_partition_six_tuple_ten_mod_243_fac i) =      designated_partition_six_tuple_twenty_two_divisible_by_243_facVal i e :=  designated_partition_six_tuple_ten_mod_243_fac_coeff i hi e/-- The convolution list computes the coefficient of the product. -/lemma designated_partition_six_tuple_twenty_two_divisible_by_243_conv_spec    (L : ℕ) (a b : List ℕ) (φ ψ : PowerSeries ℕ)    (ha : ∀ k, k < L → a.getD k 0 = PowerSeries.coeff k φ)    (hb : ∀ k, k < L → b.getD k 0 = PowerSeries.coeff k ψ) :    ∀ k, k < L →      (designated_partition_six_tuple_twenty_two_divisible_by_243_conv L a b).getD k 0 =        PowerSeries.coeff k (φ * ψ) := by  intro k hk  rw [designated_partition_six_tuple_twenty_two_divisible_by_243_conv,    designated_partition_six_tuple_twenty_two_divisible_by_243_list_getD_map_range _ L k hk,    designated_partition_six_tuple_ten_mod_243_coeff_mul_range]  apply Finset.sum_congr rfl  intro i hi  rw [Finset.mem_range] at hi  rw [ha i (by omega), hb (k - i) (by omega)]/-- The partial-product list computes the coefficients of the partial products. -/lemma designated_partition_six_tuple_twenty_two_divisible_by_243_pvList_spec (j : ℕ) :    ∀ L k, k < L →      (designated_partition_six_tuple_twenty_two_divisible_by_243_pvList j L).getD k 0 =        PowerSeries.coeff k (∏ i ∈ Finset.range j,          designated_partition_six_tuple_ten_mod_243_fac (i + 1)) := by  induction j with  | zero =>    intro L k hk    simp only [designated_partition_six_tuple_twenty_two_divisible_by_243_pvList,      Finset.range_zero, Finset.prod_empty]    exact designated_partition_six_tuple_twenty_two_divisible_by_243_oneList_spec L k hk  | succ j ih =>    intro L k hk    simp only [designated_partition_six_tuple_twenty_two_divisible_by_243_pvList]    rw [designated_partition_six_tuple_twenty_two_divisible_by_243_conv_spec L _ _ _ _      (fun i hi => ih L i hi)      (fun i hi =>        (designated_partition_six_tuple_twenty_two_divisible_by_243_facList_getD (j+1) L i hi).trans          (designated_partition_six_tuple_twenty_two_divisible_by_243_facVal_coeff (j+1) (by omega) i).symm)      k hk]    rw [Finset.prod_range_succ]/-- The power list computes the coefficients of the `m`-th power of the truncation. -/lemma designated_partition_six_tuple_twenty_two_divisible_by_243_pwList_spec (M m : ℕ) :    ∀ L k, k < L →      (designated_partition_six_tuple_twenty_two_divisible_by_243_pwList M m L).getD k 0 =        PowerSeries.coeff k ((∏ i ∈ Finset.range M,          designated_partition_six_tuple_ten_mod_243_fac (i + 1)) ^ m) := by  induction m with  | zero =>    intro L k hk    simp only [designated_partition_six_tuple_twenty_two_divisible_by_243_pwList, pow_zero]    exact designated_partition_six_tuple_twenty_two_divisible_by_243_oneList_spec L k hk  | succ m ih =>    intro L k hk    simp only [designated_partition_six_tuple_twenty_two_divisible_by_243_pwList]    rw [designated_partition_six_tuple_twenty_two_divisible_by_243_conv_spec L _ _ _ _      (fun i hi => ih L i hi)      (fun i hi => designated_partition_six_tuple_twenty_two_divisible_by_243_pvList_spec M L i hi)      k hk]    rw [pow_succ]/-- Below degree 22, `F` agrees with the product of the first 22 factors. -/lemma designated_partition_six_tuple_twenty_two_divisible_by_243_coeff_gen_fun_eq    (k : ℕ) (hk : k ≤ 22) :    PowerSeries.coeff k designated_partition_gen_fun =      PowerSeries.coeff k (∏ i ∈ Finset.range 23,        designated_partition_six_tuple_ten_mod_243_fac (i + 1)) := by  rw [designated_partition_six_tuple_ten_mod_243_coeff_gen_fun k,    (designated_partition_six_tuple_ten_mod_243_coeff_prod_range_stab k 23 (by omega) k (le_rfl)).symm]/-- Below degree 22, all powers of `F` agree with those of the truncation. -/lemma designated_partition_six_tuple_twenty_two_divisible_by_243_pow_coeff_eq (m : ℕ) :    ∀ k ≤ 22,      PowerSeries.coeff k (designated_partition_gen_fun ^ m) =        PowerSeries.coeff k ((∏ i ∈ Finset.range 23,          designated_partition_six_tuple_ten_mod_243_fac (i + 1)) ^ m) := by  induction m with  | zero => intro k hk; simp  | succ m ih =>    intro k hk    rw [pow_succ, pow_succ,      designated_partition_six_tuple_ten_mod_243_coeff_mul_range,      designated_partition_six_tuple_ten_mod_243_coeff_mul_range]    apply Finset.sum_congr rfl    intro i hi    rw [Finset.mem_range] at hi    rw [ih i (by omega), designated_partition_six_tuple_twenty_two_divisible_by_243_coeff_gen_fun_eq (k - i) (by omega)]/-- The number of designated partition 6-tuples of size 22 is divisible by 243. -/theorem designated_partition_six_tuple_twenty_two_divisible_by_243 :    243 ∣ designated_partition_k_tuple 6 22 := by  show 243 ∣ PowerSeries.coeff 22 (designated_partition_gen_fun ^ 6)  rw [designated_partition_six_tuple_twenty_two_divisible_by_243_pow_coeff_eq 6 22 (by norm_num)]  rw [← designated_partition_six_tuple_twenty_two_divisible_by_243_pwList_spec 23 6 23 22 (by norm_num)]  have hval : (designated_partition_six_tuple_twenty_two_divisible_by_243_pwList 23 6 23).getD 22 0 = 6635911068 := by decide  rw [hval]  norm_num
See it in the graphDiscuss this resultChallenge it