AFTD Auto-Formalizing Theoretical Domains

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

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
See it in the graphDiscuss this resultChallenge it