Proposition VII.3 — Given three numbers not prime to one another, to find their …

Proof

Find the gcd of two of them by VII.2; then find the gcd of that result with the third. The final number measures all three and is greatest by the same persistence argument.

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

Full neighborhood

Depends on (1)

VII.2Proposition VII.2Given two numbers not prime to one another, to find their greatest common measure.

Required by (dependents) (1)

VII.33Proposition VII.33Given as many numbers as we please, to find the least of those which have the same ratio with them.

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.