by using Euclid's algorithm find the largest number which divided 650 and 1170
Share
by using Euclid's algorithm find the largest number which divided 650 and 1170
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Verified answer
Answer:
650 and 1170
650 < 1170
Thus, we divide 1170 by 650 by using Euclid's division lemma
1170 = 650 × 1 + 520
∵ The remainder is not zero,
∴ we divide 650 by 520 by using Euclid's division lemma
650 = 520 × 1 + 130
∵ The remainder is not zero,
∴ we divide 520 by 130 by using Euclid's division lemma
520 = 130 × 4 + 0
Since, Remainder is zero,
Therefore, the HCF of 650 and 1170 is 130.
Hence, the largest number which divides 650 and 1170 is 130.
please Mark as brainliest
Answer:
tum uk me aayegi aabhi
न हम रहे दिल लगाने के काबिल,
न दिल रहा ग़म उठाने के काबिल,
लगे उसकी यादों के जो ज़ख़्म दिल पर,
न छोड़ा उसने मुस्कुराने के काबिल।