radical_eighthundredforty
plain-language theorem explainer
The theorem states that the radical of 840 equals 210, the product of its distinct prime factors 2, 3, 5, and 7. Number theorists computing arithmetic functions or square-free kernels for specific composites would cite this evaluation. The proof is a direct computational verification via native_decide.
Claim. $rad(840) = 210$, where $rad(n)$ denotes the product of the distinct prime factors of $n$.
background
The module supplies lightweight wrappers around Mathlib arithmetic functions, beginning with the Möbius function μ. The radical extracts the square-free kernel of a positive integer. Upstream results include list definitions such as the seven plot families and the set of eight kinship systems, supplied through broad module imports that also reference radical distributions in cost metrics.
proof idea
The proof is a term-mode one-line wrapper that applies native_decide to confirm the equality by built-in computation.
why it matters
This supplies a verified numerical instance of the radical function inside the arithmetic functions module. It may support concrete checks in prime-distribution contexts within the Recognition framework, though no parent theorems or direct used-by links are recorded.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.