NUMBER SYSTEM

APTITUDE DEVELOPMENT SEM 01

Types of Numbers in Maths
According to the properties and how they are represented in the number line, the numbers are classified into different
types. Each classification of number is provided herewith description, properties, and examples to understand it in a
better way. The different types of numbers are as follows:

Natural Numbers
Natural numbers are also called “counting numbers” which contains the set of positive integers from 1 to infinity. The set of natural
numbers is represented by the letter “N”. The natural number set is defined by:
N = {1, 2, 3, 4, 5, ……….}
Examples: 35, 59, 110, etc.

Whole Numbers
Whole numbers are also known as natural numbers with zero. The set consists of non-negative integers where it does not contain any
decimal or fractional part. The whole number set is represented by the letter “W”. The natural number set is defined by:
W = {0,1, 2, 3, 4, 5, ……….}
Examples: 67, 0, 49, 52, etc.

Integers
Integers are defined as the set of all whole numbers with a negative set of natural numbers. The integer set is represented by the symbol
“Z”. The set of integers is defined as:
Z = {-3, -2, -1, 0, 1, 2, 3}
Examples: -52, 0, -1, 16, 82, etc
Real Numbers
Any number such as positive integers, negative integers, fractional numbers or decimal
numbers without imaginary numbers are called the real numbers. It is represented by the letter
“R”.
Examples: ¾, 0.333, √2, 0, -10, 20, etc.

Rational Numbers
Any number that can be written in the form of p/q, i.e., a ratio of one number over another
number is known as rational numbers. A rational number can be represented by the letter “Q”.
Examples: 7/1, 10/2, 1/1, 0/1, etc.

Irrational Numbers
The number that cannot be expressed in the form of p/q. It means a number that cannot be
written as the ratio of one over another is known as irrational numbers. It is represented by the
letter ”P”.
Examples: √2, π, Euler’s constant, etc

Complex Numbers
A number that is in the form of a+bi is called complex numbers, where “a and b” should be a
real number and “i” is an imaginary number.
Examples: 4 + 4i, -2 + 3i, 1 +√2i, etc
TEST OF DIVISIBILITY
There are certain tests of divisibility that can help us to decide whether a given number is
divisible by another number.
1. Divisibility of numbers by 2: ► A number that has 0, 2, 4, 6 or 8 in its ones place is
divisible by 2.
2. Divisibility of numbers by 3 ► A number is divisible by 3 if the sum of its digits is divisible
by 3.
3. Divisibility of numbers by 4 ► A number is divisible by 4 if the number formed by its last
two digits (i.e. ones and tens) is divisible by 4.
4. 4. Divisibility of numbers by 5 ► A number that has either 0 or 5 in its ones place is
divisible by 5.
5. 5. Divisibility of numbers by 6: ► A number is divisible by 6 if that number is divisible by
both 2 and 3.
6. 6. Divisibility of numbers by 7: ► A number is divisible by 7, if the difference b/w twice
the last digit and the no. formed by the other digits is either 0 or a multiple of 7. eg.
2975, it is observed that the last digit of 2975 is '5', so, 297 --(5x2) = 297 - 10 =287, which
is a multiple of 7 hence, it is divisible by 7
7. 7. Divisibility of numbers by 8: ► A number is divisible by 8 if the number formed by its
last three digits is divisible by 8.
8. 8. Divisibility of numbers by 9: ► A number is divisible by 9 if the sum of its digits is
divisible by 9
9. Divisibility of numbers by 10: ► A number that has 0 in its ones place is divisible by 10.

10. Divisibility of numbers by 11: ► If the difference between the sum of the digits at the
odd and even places in a given number is either 0 or a multiple of 11, then the given number
is divisible by 11.

11. Divisibility of number by 12 ► Any number which is divisible by both 4 and 3, is also
divisible by 12. To check the divisiblity by 12, we i. First divide the last two-digit number by 4.
If it is not divisible by 4, it is divisible by 4 is not divisible by 12. If it is divisible by 4 them. ii.
Check whether the number is divisible by 3 or not. Ex: 135792 : 92 is divisible by 4 and also
(1 + 3 + 5 + 7 + 9 +2 =) 27 is divisible by 3 ; hence the number is divisible by 12.

12. Divisibility by 13
Oscillator for 13 is 4. But this time, our oscillator is not negative (as in case of 7) It is 'one-
more' Oscillator. So, the working Principle will be different now. Eg: Is 143 divisible by 13 ?
Sol: 14 3 : 14 + 3 x 4 = 26 Since 26 is divisible by 13, the number 143 is also divisible by 13. Eg
2 : Check the divisibility by 13. 2 416 7 26/6/20/34 [ 4 x 7 ( from 24167 ) + 6 ( from 24 167) =
34] [4 x 4 ( from 3 4 ) + 3 (from 3 4 ) + 1 (from 24167)] =20 [4 x 0 (from 2 0 ) + 2 (from 20) + 4
(from 24 167)= 6] [4 x 6 (from 6 ) + 2 (from 24 167)= 26] Since 26 is divisible by 13 the
number is also divisible by 13.
General rules of divisibility for all numbers:
♦ If a number is divisible by another number, then
it is also divisible by all the factors of the other
number.
♦ If two numbers are divisible by another number,
then their sum and difference is also divisible by
the other number.
♦ If a number is divisible by two co-prime
numbers, then it is also divisible by the product of
the two co-prime numbers.
INTEGERS
• Whole numbers are represented on the number line as shown here: -9 -8 -7 -6 -5 -4 -3 -2 -
10123456789
• If you move towards the right from the zero mark on the number line, the value of the
numbers increases.
▪ If you move towards the left from the zero mark on the number line, the value of the
numbers decreases. i. Integers: The collection of the numbers, that is, ... -3, -2, -1, 0, 1, 2,
3, ...., is called integers.
ii. Negative integers: The numbers -1, -2, -3, -4... which are called negative numbers.
iii. Positive integers: The number 1, 2, 3, 4 ...s, which are called positive
• Euclid's division lemma can be used to: a = b q + r • Find the highest common factor of any
two positive integers and to show the common properties of numbers.
• Finding H.C.F using Euclid's division lemma.
• Suppose, we have two positive integers 'a' and 'b' such that 'a' is greater than 'b'. Apply
Euclid's division lemma to the given integers 'a' and 'b' to find two whole numbers 'q' and 'r'
such that, 'a' is equal to 'b' multiplied by 'q' plus 'r’.
• Check the value of 'r': If 'r' is equal to zero then 'b' is the HCF of the given numbers. If 'r' is
not equal to zero, apply Euclid's division lemma to the new divisor 'b' and remainder 'r'.
Continue this process till the remainder 'r' becomes zero. The value of the divisor 'b' in that
case is the HCF of the two given numbers.
• Euclid's division algorithm can also be used to find some common properties of numbers.
Percent
The term percent means ‘for every hundred’. If can be defined as: “A fraction whose
denominator is 100 is called percentage, and the numerator or the fraction is called the rate
per cent.”
1. If the number 517*324 is completely divisible by 3, then the smallest
whole number in the place of * will be
(A) 2 (B) 3 (C) 4 (D) 5

2. If the number 481*673 is completely divisible by 9, then the smallest

whole number in the place of * will be ?
(A) 4 (B) 3 (C) 6 (D) 7
3. How many three digit numbers are divisible by 5 or 9?
(A) 260 (B) 280 (C) 200 (D) 180
4. If x and y are two digits of the number 653xy such that this number is
divisible by 80, then x + y = ?
(A) 2 (B) 3 (C) 4 (D) 5
5. On dividing a number by 357, we get 39 as remainder. On dividing the
same number by 17, what will be the remainder ?
(A) 2 (B) 3 (C) 4 (D) 5