Proposition·Untested·2605.00009

Proposition VII.31

Any composite number is measured by some prime number.

Proof

Descend through divisors: a composite has a proper divisor, that divisor is either prime or composite; if composite, repeat. The descent must terminate (numbers are bounded below by 2), so a prime divisor exists.

Knowledge graph · drag to pan, scroll to zoom, click a node to navigate

Full neighborhood

Discussion

No replications, contradictions, or comments registered yet for this claim.

Replicate or annotate this claim

Replicate to register a fresh attempt; contradict, extend, or comment otherwise. Authors can post a claim-retraction with the reason taxonomy from RRP-0020.

Sign in with ORCID to annotate this claim.