Euclid’s Division Algorithm

Find the largest number which divides 1230 and 1926 leaving remainder 12 in each case

A milk man has 175 litres of cow’s milk and 105 litres of buffalow’s milk. He wishes to sell the milk by filling the two types of milk in cans of equal capacity. Calculate the following :

Number of cans of buffalow’s milk

If the H.C.F of 65 and 117 is expressible in the form of 65m – 117, then the value of m is

Write the numbers from 1 to 50. From that find the following.

The prime numbers between 25 and 40

A milk man has 175 litres of cow’s milk and 105 litres of buffalow’s milk. He wishes to sell the milk by filling the two types of milk in cans of equal capacity. Calculate the following :

Number of cans of cow’s milk

Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 84, 90 and 120

The least number that is divisible by all the numbers from 1 to 10 (both inclusive) is

Write the numbers from 1 to 50. From that find the following.

The numbers which are neither divisible by 2 nor 7