Question
Using Euclid’s division algorithm, find gcd(135, 225). (NCERT Class 10 – Important)
Answer: Apply Euclid: 225 = 135×1 + 90; 135 = 90×1 + 45; 90 = 45×2 + 0. The last non‑zero remainder is 45, so gcd(135,225)=45.
Product builds · Web / Android / iOS
Share your quick brief and I’ll reply with a scoped plan.
Question
Answer: Apply Euclid: 225 = 135×1 + 90; 135 = 90×1 + 45; 90 = 45×2 + 0. The last non‑zero remainder is 45, so gcd(135,225)=45.
Question
Answer: Apply Euclid: 225 = 135×1 + 90; 135 = 90×1 + 45; 90 = 45×2 + 0. The last non‑zero remainder is 45, so gcd(135,225)=45.