what is euclid's algorithm
Answers
Answered by
0
It is a way to find the HCF of two +Ve integers.
Anonymous:
Was it helpful for you?
Answered by
1
The Euclid algorithm is a way to find the greatest common divisor of two positive integers, a and b. First let me show the computations for a=210 and b=45. Divide 210 by 45, and get the result 4 with remainder 30 SO, 210=4.
Good, How's your next tab google from which you've copied.
ACTUALLY I KNOW THIS IS SAME THING THERE IN GOOGLE BUT THE SAME THING IT IS THERE IN MY REFERENCE BOOK SO I AM SORRY I HAVE NOT COPIED IT IS GIVEN LIKE EXAMPLE IN MY REFERENCE BOOK SO I AM SORRY I CAN'T HELP!!
Take a break buddy!!!
i did not get you dear??
Similar questions