use euclid division algorithm and find hcf of two prime numbers
Answers
Answered by
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:
Similar questions