Takes you to places where you belong.

Basic concepts, definitions and identities

Number SystemTest of divisibility:

A number is divisible by ‘2’ if it ends in zero or in a digit which is a multiple of ‘2’i.e. 2,4, 6, 8.2.

A number is divisible by ‘3’, if the sum of the digits is divisible by ‘3’.3.

A number is divisible by ‘4’ if the number formed by the last two digits, i.e. tensand units are divisible by 4.4.

A number is divisible by ‘5’ if it ends in zero or 55.

A number is divisible by ‘6’ if it divisible by ‘2’ as well as by ‘3’.6.

A number is divisible by ‘8’ if the number formed by the last three digits, i.e,hundreds tens and units is divisible by ‘8’.7.

A number is divisible by ‘9’ if the sum of its digit is divisible by ‘9’ 8.

A number is divisible by ‘10’ if it ends in zero.9.

A number is divisible by ‘11’ if the difference between the sums of the digits inthe even and odd places is zero or a multiple of ‘11’.

LCM:

LCM of a given set of numbers is the least number which is exactly divisibleby every number of the given set.

HCF:

HCF of a given set of numbers is the highest number which divides exactlyevery number of the given set.

LCM, HCF:

Product of two numbers = HCF

LCM2.

HCF of fractions =rsdenominatoof LCM numeratorsof HCF 3.

LCM of fractions =rsdenominatoof HCF numeratorsof LCM 4.

One number =number2ndHCFLCM

LCM of two numbers=HCFnumberstheof Product 6.

LCMnumberstheof Product HCF

Takes you to places where you belong.

Examples to Follow:

The square of an odd number is always odd.2.

A number is said to be a prime number if it is divisible only by itself and unity.Ex. 1, 2, 3, 5,7,11,13 etc.3.

The sum of two odd number is always even.4.

The difference of two odd numbers is always even.5.

The sum or difference of two even numbers is always even.6.

The product of two odd numbers is always odd.7.

The product of two even numbers is always even.

Problems:

If a number when divided by 296 gives a remainder 75, find the remainder when37 divides the same number.Method:Let the number be ‘x’, say

∴

x = 296k + 75, where ‘k’ is quotient when ‘x’ is divided by ‘296’ = 37

8k + 37

2 + 1= 37(8k + 2) + 1Hence, the remainder is ‘1’ when the number ‘x’ is divided by 37.2.

If 2

+1 is divisible by 641, find another number which is also divisible by ‘641’.Method:Consider 2

+1 = (2

)

+ 1

= (2

+1)(2

-2

+1)From the above equation, we find that 2

+1 is also exactly divisible by 641,since it is already given that 2

+1 is exactly divisible by ‘641’.3.

If m and n are two whole numbers and if m

= 25. Find n

, given that n

≠

1Method:

Takes you to places where you belong.

= 25 = 5

∴

m = 5, n = 2

∴

= 2

= 324.

Find the number of prime factors of 6

= 2

∴

The number of prime factors = the sum of all the indices viz., 10 + 10 + 17 +27 + 27 = 915.

A number when successively divided by 9, 11 and 13 leaves remainders 8, 9 and8 respectively.Method:The least number that satisfies the condition= 8 + (9

9) + (8

11) = 8 + 81 +792 = 8816.

A number when divided by 19, gives the quotient 19 and remainder 9. Find thenumber.Let the number be ‘x’ say.x = 19

19 + 9= 361 + 9 = 3707.

Four prime numbers are given in ascending order of their magnitudes, theproduct of the first three is 385 and that of the last three is 1001. Find thelargest of the given prime numbers.The product of the first three prime numbers = 385The product of the last three prime numbers = 1001In the above products, the second and the third prime numbers occur incommon.

∴

The product of the second and third prime numbers = HCF of thegiven products.HCF of 385 and 1001 = 77

∴

Largest of the given primes =771001= 13