| max_exp(i, fac(i1)) = Σ countFun(1, i0 - 1, λ j1. i1 / i ^ j1), (i1 * i + j2) / i = i1, 0 < i0, 0 < i1, 0 < i1 * i + j2, 0 < i, 0 ≤ j2, prime(i), i1 * i + j2 < i ^ i0, 0 < i ^ i0, 0 ≤ i0, 1 < i ^ i0, j2 < i, ∀ j0, i2, i0. i→n(j0) < i→n(i1 * i + j2) → prime(i2) ∧ j0 < i2 ^ i0 ∧ 0 < j0 ∧ 0 < i2 ^ i0 ∧ 0 ≤ i0 ∧ 1 < i2 ^ i0 → max_exp(i2, fac(j0)) = Σ countFun(1, i0, λ j1. j0 / i2 ^ j1) ⊦ max_exp(i, fac(i1)) = Σ countFun(2, i0, λ j0. (i1 * i + j2) / i ^ j0) |
max_exp(i, fac(i1)) = Σ countFun(1, i0 - 1, λ j1. i1 / i ^ j1), (i1 * i + j2) / i = i1, 0 < i0, 0 < i1, 0 < i1 * i + j2, 0 < i, 0 ≤ j2, prime(i), i1 * i + j2 < i ^ i0, 0 < i ^ i0, 0 ≤ i0, 1 < i ^ i0, j2 < i, ∀ j0, i2, i0. i→n(j0) < i→n(i1 * i + j2) → prime(i2) ∧ j0 < i2 ^ i0 ∧ 0 < j0 ∧ 0 < i2 ^ i0 ∧ 0 ≤ i0 ∧ 1 < i2 ^ i0 → max_exp(i2, fac(j0)) = Σ countFun(1, i0, λ j1. j0 / i2 ^ j1) ⊦ Σ countFun(1, i0 - 1, λ j1. i1 / i ^ j1) = Σ countFun(2, i0, λ j0. (i1 * i + j2) / i ^ j0)