vp_840_five
plain-language theorem explainer
The theorem asserts that the exponent of prime 5 in the factorization of 840 is exactly one. Researchers using RS constants for arithmetic anchors in number theory proofs would reference this fact to avoid repeated factorization calculations. The proof relies on a single native_decide tactic that computes the prime factorization directly.
Claim. $v_5(840) = 1$
background
The RS constants module gathers small decidable arithmetic facts about integers that recur in the reality repo, including 840 and various primes. These facts act as stable anchors that keep subsequent bridge lemmas readable without repeated arithmetic proofs. The upstream definition states that vp p n is the exponent of p in the prime factorization of n, given by n.factorization p.
proof idea
A one-line wrapper applies the native_decide tactic to compute the factorization of 840 and extract the exponent of 5.
why it matters
This result supplies a concrete arithmetic fact within the RS constants file, which collects prime facts and factorizations to support the broader Recognition Science framework. It contributes to the collection of anchors for numbers like 8, 45, 360, and 840. No parent theorems or open questions are directly tied in the provided data.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.