decimal number system proof

r = (0, 1, 2, 3, . . . n) Hence the total number of subsets i..

We shall use PMI to prove tha..

Replacing q by ix, ..

Similarly, ..

From the definition of inverse of a matrix, we have (AB)(AB) - 1 = I or A - 1 (AB)(AB) - 1 = A - 1 I (Pre-multiplying both sides by A - 1 ) or (A - 1 A) B (AB) - 1 = A - 1 (Since A - 1 I = A - 1 ) or I B (AB) - 1 = A - 1 or B (AB) - 1 = A - 1 or (B - 1 B)(AB) - 1 =B - ..

Let p(x) be a polynomial divided by (x-a). Let q(x) be the quotient and R be the remainder. By division algorithm, Dividend = (Divisor x quotient) + Remainder p(x) = q(x) . (x-a) + R Substitute x = a, p(a) = q(a) (a-a) + R p(a) = R (a - a = 0, 0 - q (a) = 0) Hence Remainder = p(..

Let A be any set. In order to prove that f A we must show that there is no element of f which is not present in A. And since f contains no element at all, no such element can be found out. Hence f A...

Every set A is a subset of universal set U since, by definition all elements of A belong to U. Also the null set f A..

A recurring decimal is denoted by placing dots or a bar over recurring digits. Express the following recurring decimals as equivalent fractions: (a) (b) (c) (a) Let x = 0.4444 Multiply both sides by 10 ( one digit is recurring)..