Math, asked by harshitha3424, 3 months ago

find the answer by Euclids
division method. ​

Attachments:

Answers

Answered by kanishka172213
0

Answer:

Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. HCF of two positive integers a and b is the largest positive integer d that divides both a and b.

Answered by dhruvnand18
1

Answer:

here is a simple solution dude

Attachments:
Previous Question
Next Question
Similar questions
English, 1 month ago
explanation of poem wise by Aileen fisher ​...
Economy, 1 month ago
following is the marks of 8 students. find out arithmetic mean by shortcut method and step deviation method 30,45,60,45,15,65,85,20​...
Environmental Sciences, 1 month ago
\huge \red { զմҽsԵíօղ } => Wht uhh understand by density of object ?​
Math, 3 months ago
Check whe ther given sides are the sides of right-angled triangles,using phytha go ras the orem. 30,40,50​...
Computer Science, 3 months ago
Scanner resolution measured in * Inches Resolution dpi None​...
Math, 10 months ago
Expand (2a+b)^3 from the chapter expansion...
Hindi, 10 months ago
Bhasha ka mool roop options 1 mokhik, likhit...
Math, 10 months ago
How to measure 3.25 on a ruler??