No products in the cart.

Using Euclid's algorithm, find the largest …

CBSE, JEE, NEET, CUET

CBSE, JEE, NEET, CUET

Question Bank, Mock Tests, Exam Papers

NCERT Solutions, Sample Papers, Notes, Videos

Using Euclid's algorithm, find the largest number that divided 1251, 9377 and 15628 leaving remainder 1,2 and 3 respectively
  • 1 answers

Ankit Class 1 year ago

Subtract 1,2,3 from these no we get 1250, 9375, 15625 now use Euclid algorithm first in any of two then you get HCF of those two number then use again Euclid algorithm in HCF that you got with the third number
http://mycbseguide.com/examin8/

Related Questions

Prove √2-5as irrational
  • 0 answers
3.11stques
  • 0 answers
Ch 3 ex 3.3
  • 1 answers
a+b ka hool square
  • 1 answers
7+7+√7
  • 1 answers
Which I TEAM ARE YOU SUPPORTING
  • 2 answers

myCBSEguide App

myCBSEguide

Trusted by 1 Crore+ Students

Test Generator

Test Generator

Create papers online. It's FREE.

CUET Mock Tests

CUET Mock Tests

75,000+ questions to practice only on myCBSEguide app

Download myCBSEguide App