is_m_number
def
A natural number n is an M-number if for every prime p, p^p does not divide n.
Statement
def is_m_number (n : ℕ) : Prop
- Defined in
- arXiv:2610.37512 Section 1
- Verified
- 28 Oct 2026
- Axioms
- none listed
- Used by 6
- is_m_number_oneThe natural number 1 is an M-number.
- factorization_lt_of_is_m_numberIf n is a positive M-number and p is prime, then n.factorization p < p.
- is_m_number_of_strongly_matchableIf a positive integer n is strongly matchable, then n is an M-number.
- is_m_number_of_dvd_not_dvd_powFor natural numbers d, n, and p, if d divides n, every prime q such that q^q divides n satisfies q = p, and p^p does not divide d, then d…
- is_m_number_of_dvdIf n is an M-number and d divides n, then d is an M-number.
- not_is_m_number_fourThe natural number 4 is not an M-number.
Read back from the Lean
A natural number $n$ satisfies is_m_number if and only if for every natural number $p$, if $p$ is prime, then $p^p$ does not divide $n$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- An integer n is an M-number if p^p does not divide n for every prime p. -/ def is_m_number (n : ℕ) : Prop := ∀ p : ℕ, p.Prime → ¬ p ^ p ∣ n