nat_prime_power_parts
def
S(q): the set of maximal prime-power divisors of q, i.e. p^(v_p(q)) for each prime p dividing q.
Statement
def nat_prime_power_parts (q : ℕ) : Finset ℕ- Defined in
- arXiv:2610.11098 (An improved lower bound for separating words by permutation automata), Lemma 2.3 (the set S(q) of maximal prime-power divisors of q).
- Verified
- 11 Oct 2026
- Axioms
- none listed
- Used by 3
- nat_prime_power_parts_oneS(1) = ∅.
- perm_order_eq_prod_and_sum_prime_power_parts_leLet k ≥ 1. If q is the order of some permutation of k elements and S(q) is the set of maximal prime-power divisors of q, then q =…
- nat_prime_power_parts_prime_powFor a prime p and k ≥ 1, S(p^k) = {p^k}.
Lean source view module on GitHub
/-- The maximal prime-power divisors of `q`: `p ^ (multiplicity of p in q)` for each prime factor `p` of `q`. -/ def nat_prime_power_parts (q : ℕ) : Finset ℕ := q.primeFactors.image (fun p => p ^ q.factorization p)