Euclid's Division Lemma
[Euclids division Algoritham]
A number when divided by 6 leaves a remainder 3. When the square of the number is divided by 6, the remainder is 3.
According to Euclid's division lemma, if a and b are two positive integers with a>b, then which of the following is true? (Here, q and r are unique integers.)
a=b×r where 0≤r<b
b=aq+r where 0≤r<a
a=bq+r where 0≤r<b
a=b+r where 0≤r<a
Every positive odd integer is of the form 2q+1, where q is some integer.
What is the least number that must be added to 1056 so the number is divisible by 23?
The product of 3 consecutive numbers, when the first number is even is divisible by ___
all of these
Two numbers a and b, when divided by 7 and 6 respectively, leave remainders p and q respectively. What is the maximum value of p + q ?
If p=ax.by.cz and q=3x.b4.5z where a, b, c are primes and x, y, z are natural numbers, then which of the following is true if p=q ?
a + c = 2y
a = 3x
a = b = c
x = y = z
If 2p.3q.5r=60, which of the following is true? Given; p, q, r are natural numbers.
p + q + r = 0
p = q = r
p = 2 , q = r = 1
p + q + r = 3
If the number 126.96.36.199.24...........188.8.131.52.34........310
is written in power of '6' then the highest
power of '6' is _____.