Math, asked by GRSVIS3049, 9 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

English, 4 months ago

Write a letter to your friend inviting him to celebrate housewarming of new house...

English, 4 months ago

You have visited picnic tour with your parents...

English, 4 months ago

What suggestion did Mr. Bennet have for Mrs.Bennet ? Give reason for your answer.

Math, 9 months ago

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

Science, 9 months ago

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

English, 1 year ago

a visit to a hill station Gangtok essay ...

English, 1 year ago

paragraph plantation programmes...

Science, 1 year 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...