Home
Class 10
MATHS
Use Euclid’s division algorithm to find ...

Use Euclid’s division algorithm to find the `gt` HCF of ( 1 ) 135 and 225 ( 2 ) 196 and 382 2 0 ( 3 ) 867 and 255.

Text Solution

Verified by Experts

The correct Answer is:
51
Promotional Banner

Topper's Solved these Questions

  • REAL NUMBERS

    KUMAR PRAKASHAN|Exercise EXERCISE 1.2|7 Videos

  • REAL NUMBERS

    KUMAR PRAKASHAN|Exercise EXERCISE 1.3|3 Videos

  • REAL NUMBERS

    KUMAR PRAKASHAN|Exercise OTHER IMPORTANT EXAMPLES|10 Videos

  • QUESTION PAPER-2

    KUMAR PRAKASHAN|Exercise Section C|14 Videos

  • SOME AAPLICATIONS OF TRIGONOMETRY

    KUMAR PRAKASHAN|Exercise Objective Questions|24 Videos

Similar Questions

Explore conceptually related problems

Using Euclid’s division algorithm, find the HCF of 1620, 1725 and 255.

Using Euclid’s division algorithm, find the HCF of 441, 567 and 693.

Using Euclid’s division algorithm, find the HCF of 5404 and 4800

Use Euclid’s algorithm to find the HCF of 4052 and 12576.

Use Euclid's algorithm to find the HCF of 196 and 38220

Use Euclid's algorithm to find the HCF of 1651 and 2032

Use Euclid's algorithm to find the HCF of 900 and 270

Using Euclid’s division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3 respectively.

Find the LCM and HCF of the following pairs of integers and verify that LCM X HCF = product of the two numbers : ( 1 ) 26 and 91 ( 2 ) 510 and 92 ( 3 )336 and 54

Can you find the HCF of 1.2 and 0.12? Justify your answer.