G.251 numbers prime find

VII.2

Given two numbers not prime to one another, to find their greatest common measure.
numbers_prime_find(/ A B /, / C D /)
given / A B /, / C D / be the two given numbers not prime to one another
construct PORISM. From this it is manifest that, if a number measure two numbers, it will also measure their greatest common measure
A E B C F D G
given / A B /, / C D / be the two given numbers not prime to one another
assert If now / C D / measures / A B /—and it also measures itself—/ C D / is a common measure of / C D /, / A B /
assert It is manifest that it is also the greatest
assert For no greater number than / C D / will measure / C D /
assert But, if / C D / does not measure / A B /, then, the less of the numbers / A B /, / C D / being continually subtracted from the greater, some number will be left which will measure the one before it
∵ unequal_numbers_setassert For an unit will not be left; otherwise / A B /, / C D / will be prime to one another, which is contrary to the hypothesis
assert some number will be left which will measure the one before it
assert Now let / C D /, measuring / E B /, leave / A E / less than itself, let / A E /, measuring / F D /, leave / C F / less than itself, and let / C F / measure / A E /
assert then, / C F / measures / A E /, and / A E / measures / F D /,
assert / C F / will also measure / F D /
assert It also measures itself
assert it will also measure / C D /
assert / C D / measures / E B /
assert / C F / also measures / E B /
assert It also measures / A E /
assert it will also measure / A B /
assert It also measures / C D /
assert / C F / measures / A B /, / C D /
assert / C F / is a common measure of / A B /, / C D /
assert I say next that it is also the greatest
assert If / C F / is not the greatest common measure of / A B /, / C D /, some number which > / C F / will measure the numbers / A B /, / C D /
assert Let such a number measure them, and let it be G
assert G measures / C D /, while / C D / measures / E B /,
assert G also measures / E B /
assert It also measures / A B /
assert it will also measure / A E /
assert / A E / measures / F D /
assert G will also measure / F D /
assert It also measures / C D /
assert it will also measure / C F /, that is, the greater will measure the less ⇒⇐
assert no number which > / C F / will measure the numbers / A B /, / C D /; therefore / C F / is the greatest common measure of / A B /, / C D /
∴ PORISM. From this it is manifest that, if a number measure two numbers, it will also measure their greatest common measure

Dependency Graph

digraph { bgcolor="transparent"; node [shape=box, style="rounded,filled", fontname="Helvetica", fontsize=11, color="#d6d3cd", fontcolor="#ffffff"]; edge [color="#8c857b", fontcolor="#8c857b", arrowsize=0.75]; rankdir="TB"; "G.169" [label="G.169", tooltip="G.169 (V.def.1): A magnitude is apart of a magnitude, the less of the greater, when it measures the greater.", fillcolor="#224422", URL="../G.169/index.html", target="_top"]; "G.247" [label="G.247", tooltip="G.247 (VII.def.1): Anunit is that by virtue of which each of the things that exist is called one.", fillcolor="#224422", URL="../G.247/index.html", target="_top"]; "G.248" [label="G.248", tooltip="G.248 (VII.def.2): Anumber is a multitude composed ofunits.", fillcolor="#224422", URL="../G.248/index.html", target="_top"]; "G.249" [label="G.249", tooltip="G.249 (VII.def.12): Numbers prime to one another are those which aremeasured by anunit alone as a common measure.", fillcolor="#224422", URL="../G.249/index.html", target="_top"]; "G.250" [label="G.250", tooltip="G.250 (VII.1): Two unequal numbers being set out, and the less being continually subtracted in turn from the greater, if the number which is left never measures the one before it until an unit is...", fillcolor="#222244", URL="../G.250/index.html", target="_top"]; "G.251" [label="G.251", tooltip="G.251 (VII.2): Given two numbers not prime to one another, to find their greatest common measure.", penwidth=2.5, color="#e8b85a", fillcolor="#4a453b", URL="index.html", target="_top"]; "G.249" -> "G.169"; "G.250" -> "G.169"; "G.251" -> "G.169"; "G.248" -> "G.247"; "G.249" -> "G.247"; "G.250" -> "G.247"; "G.251" -> "G.247"; "G.250" -> "G.248"; "G.251" -> "G.248"; "G.250" -> "G.249"; "G.251" -> "G.249"; "G.251" -> "G.250"; }

Required for

G.252, G.255, G.274, G.275, G.278, G.279, G.280, G.281, G.285, G.289, G.290, G.292, G.295, G.296, G.297, G.298, G.299, G.301, G.303, G.304, G.305, G.306, G.314, G.315, G.316, G.317, G.322, G.323, G.324, G.325, G.326, G.327, G.328, G.329, G.330, G.331, G.332, G.333, G.334, G.335, G.337, G.338, G.339, G.342, G.343, G.344, G.345, G.346, G.347, G.348, G.349, G.364, G.370, G.381, G.383, G.384, G.385, G.389, G.390, G.396, G.397, G.398, G.399, G.400, G.401, G.402, G.403, G.404, G.405, G.406, G.407, G.408, G.409, G.410, G.411, G.412, G.413, G.414, G.415, G.416, G.417, G.418, G.419, G.420, G.421, G.423, G.425, G.427, G.429, G.431, G.433, G.434, G.435, G.436, G.437, G.438, G.439, G.440, G.441, G.442, G.443, G.444, G.445, G.446, G.447, G.448, G.449, G.450, G.451, G.452, G.453, G.457, G.458, G.459, G.460, G.461, G.462, G.463, G.464, G.465, G.466, G.467, G.468, G.470, G.472, G.474, G.476, G.477, G.478, G.479, G.480, G.481, G.482, G.483, G.484, G.485, G.486, G.487, G.488, G.489, G.490, G.491, G.492, G.493, G.494, G.495, G.496, G.497, G.498, G.499, G.500, G.584, G.589, G.597, G.600, G.601