Math, asked by Anonymous, 7 months ago

use euclid division algorithm and find hcf of two prime numbers

Answers

Answered by nivi7788

0

Answer:

Let's take two prime numbers as 5 , 7

the attachment shows the algorithm

they are coprime numbers they have the HCF as one

hope it is helpful

Attachments:

Previous Question

Next Question

Similar questions

English, 4 months ago

The vulture and the great spirit The great spirit declares that the vulture is number one in many things.Is this true of human beings. Plzz give answers correctly.Plzz don't do any mischieve.☠️...

Math, 4 months ago

0.0000463 in standard form is...

Social Sciences, 4 months ago

answer any of these questions plz...

Computer Science, 7 months ago

which industry among the ITes has helped many educated indian find jobs ? plz answer faster with explain plzzzzzzzzzzzzzzzzzzzzzzzzzz and follow me I will also follow back............... computer question give me answer...

English, 7 months ago

Answer this question if a is b and b is o, o is d ,d is l,l is v is you is they so who is l...

Business Studies, 10 months ago

Vipdan ki samasya isse labh aur haani...

History, 10 months ago

Who was lenin? What was rule made by lenin...

Geography, 10 months ago

What is the correlation between the transport routes and the physiography of a region??