2007-12-26 09:24:37 · 5 answers · asked by linc 1 in Science & Mathematics ➔ Mathematics
I couldnt agree more. You are SOO right
2007-12-26 10:06:50 · answer #1 · answered by Anonymous · 0⤊ 1⤋
I'll assume your Uchlid is actually Euclid and you are referring to Euclid algorithm for finding the greatest common factor for two numbers. Well, the principle is something like this: The greatest factor between u and v is the same as the greatest factor between u-v and v, if u is greater than v. This process can be continued recursively until the smaller number goes to zero at which time, the common factor will be the bigger number.
2007-12-26 18:13:53 · answer #2 · answered by Anonymous · 1⤊ 0⤋
Do you mean Euclid? Which problem of his do you
want to pose?
2007-12-26 17:31:25 · answer #3 · answered by steiner1745 7 · 1⤊ 0⤋
Give me a verb, you child.
2007-12-26 17:41:23 · answer #4 · answered by Anonymous · 2⤊ 0⤋
great question. i must confess that I don't know the answer.
2007-12-26 17:28:20 · answer #5 · answered by Not Eddie Money 3 · 1⤊ 2⤋