pith. sign in
theorem

prime_twohundredeightythree

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

plain-language theorem explainer

283 is prime. Number theorists working with Möbius evaluations in the Recognition Science arithmetic functions module cite this fact for prime-specific cases. The verification executes a direct computational decision procedure.

Claim. The natural number 283 is prime, i.e., $Prime(283)$ where $Prime(n)$ is the transparent alias for $Nat.Prime(n)$.

background

The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function μ. Prime is defined locally as the transparent alias for Nat.Prime. The setting prepares for later Dirichlet algebra once basic interfaces stabilize.

proof idea

One-line wrapper that applies native_decide to confirm the primality statement computationally.

why it matters

Supplies a concrete prime instance supporting arithmetic function calculations such as Möbius on primes. It occupies a basic slot in the primes submodule but records no downstream uses and does not engage T0-T8, RCL, or phi-ladder constructions.

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