- According to Euclid's division algorithms HCF of any two positive integers a and b with a > b is obtained by applying Euclid's division lemma to a and b to find q and r such that a = bq + r where r must satisfy.
- 1 < r < b
- 0 < r < b
- 0 < = r < b
- 0 < r <=b
- The decimal expansion of 141 / 120 will terminate after how many places of decimals?
- 1
- 2
- 3
- Will not terminate
- The decimal expansion of 131 / 120 will terminate after how many places od decimal?
- 1
- 2
- 3
- Will not terminate
- According to Euclid's division algorithm using Euclid's division lemma for two positive integer a and b with a > b enables us to find:
- HCF
- LCM
- Decimal expansion
- Probability
- The decimal expansion of 6 / 1250 will terminate after how many places of decimal?
- 1
- 2
- 3
- 4
- For some integer m, every even integer is of form
- m
- m + 1
- 2m
- 2m + 1
- For some integer q, every odd integer is of the form
- q
- q + 1
- 2q
- 2q + 1
- If two positive integer a and b are written as
a = x3 y2 and b = xy3 , x, y are prime numbers, then HCF (a, b) is
- xy
- xy2
- x3 y3
- x2 y2
- If two positive integer p and q can be expresses as
P = ab2 and q = a3b, a, b being prime numbers, then LCM (p, q) is:
- ab
- a2 b2
- a3 b2
- a3 b3
- The product of a non- zero rational and an irrational number is:
- Always irrational
- Always rational
- Always or irrational
- One
- The decimal expansion of the rational number 14587 / 1250 will terminate after:
- One decimal
- Two decimal
- Three decimal
- Four decimal
