Solution:
According to the division algorithm, if p(x) and g(x) are two polynomials with g(x) ≠ 0, then we can find polynomials q(x) and r(x) such that p(x) = g(x) ×...
Solution:
Since, 1, 2 and 3 are the remainders of 1251, 9377 and 15628 respectively.
So, 1251 – 1 = 1250 is exactly divisible by the required number,
9377 – 2 = 9375...
Solution:
Let the three consecutive positive integers be n, n + 1 and n + 2, where n is any integer.
By Euclid’s division lemma, we have
a = bq + r; 0 ≤...
Let, a = 2p+1, p∈N
and b = 2q+1 , q∈N\(\cup\){0}
\(\because\) a > b ⇒ 2p+1 > 2q+1 ⇒ p > q
\(\frac{a+b}{2}\) = \(\frac{2p+1+2q+1}{2}\) = p+q+1
\(\frac{a-b}{2}\) = \(\frac{2p+1-(2q+1)}{2}\) = p-q
Case-I: \(\frac{a+b}{2}\) is odd
which implies p+q+1 is odd
\(\Rightarrow\) p+q is even (\(\because\) odd - 1 = even)
\(\Rightarrow\) p+q-2q...