Math, asked by GRSVIS3049, 8 months ago

Define Euclid algorithm for HCF with example

Answers

Answered by geethu2004

Background: greatest common divisor. The Euclidean algorithm calculates the greatest common divisor (GCD) of two natural numbers a and b. ... For example, neither 6 nor 35 is a prime number, since they both have two prime factors: 6 = 2 × 3 and 35 = 5 × 7.

Previous Question

Next Question

Similar questions

Math, 4 months ago

divide 5600 in the ratio 3:5...

Math, 4 months ago

1. Find which of the following are cubes of rational numbers? a. 64 __ 126 b. 27 __ 10 c. 0.001331 d.0.07 2 Which is the unit's digit of a cube of 125125125? a. 2 b. 1 c. 3 d. 5 3. Three numbers are the ratio 1:2:3. The sum of their cubes in 98784. Find the number? a. 14, 28, 35 b. 14, 28, 42 C. 12, 28, 42 d.14, 24, 42 4 The value of 412-392 is b. 150 b. 152 C.168 d. 180 ...

History, 4 months ago

The truth and authenticity of this information needs to be verified. * The truth and authenticity of this information needs to be verified. * 1 point Internet Museums Postage Stamps ...

Math, 8 months ago

Find the side of a cube whose volume is 5.832Cm^3...

Science, 8 months ago

what is cheaper than wool but just as warm...

English, 11 months ago

a visit to a hill station Gangtok essay ...

English, 11 months ago

paragraph plantation programmes...

Science, 11 months ago

Write the adverse effects caused by the pollutants: Pollutant 1. Carbon monoxide 2. Carbon dioxide 3. Soot Particle 4. Suspended particulate matter 5. Sulphur dioxide and oxides of nitrogen what is the adverse effect of these pollutants...