pith. sign in
theorem

prime_threehundredseventythree

proved
show as:
module
IndisputableMonolith.NumberTheory.Primes.ArithmeticFunctions
domain
NumberTheory
line
2018 · github
papers citing
none yet

plain-language theorem explainer

373 is a prime natural number. Researchers applying Möbius inversion or other arithmetic functions over specific primes in the Recognition Science library would cite this fact. The verification is a direct computational check via the native_decide tactic.

Claim. $373$ is a prime number, i.e., it satisfies the predicate that it has no divisors other than 1 and itself.

background

The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function μ. Prime is the transparent alias for Nat.Prime. This supplies a concrete primality fact that can anchor applications of those functions to the integer 373.

proof idea

One-line wrapper that applies the native_decide tactic to decide the primality predicate by direct computation.

why it matters

The result supplies a basic number-theoretic fact inside the primes submodule that supports the arithmetic functions layer. It fills a prerequisite for any later Möbius or inversion statements that reference 373. No downstream uses are recorded.

Switch to Lean above to see the machine-checked source, dependencies, and usage graph.