Number Systems: Natural Numbers

Number Systems
2. NUMBER SYSTEMS
Natural Numbers:
The counting numbers 1,2,3-----are called natural numbers and is denoted by N
Whole Numbers:
All Natural numbers along with zero are called whole numbers and is denoted by W
Integers:
The natural numbers, the negative of the natural numbers and zero are integers. It is denoted
by Z i.e., {--------2,-1, 0, 1, 2-----}
Rational Numbers:
p p
A number of the form , where q  0, p and q are integers, and is in the lowest form i.e.,
q q
P and q have no common factors, is called a Rational Number.
Irrational number:
A non terminating and non recurring decimal is called irrational number
Real Numbers:
The collection of rational numbers and irrational numbers is called set of real numbers.
Even Numbers:
A number which is divisible by 2 is called an even number
Odd Numbers:
A number which is not divisible by 2 is called an odd number.
Prime Numbers:
A number, other than 1 is called a prime number, if it is divisible by 1 and itself only.
Composite Numbers:
A number, other than 1, which is not prime, is called a composite number
Tests of Divisibility:
Divisibility by 2
A number is said to be divisible by 2, if its units digit is any of 0, 2, 4, 6, 8
 ICP–Intensive Classroom Program  eGATE-Live Internet Based Classes DLP  TarGATE-All India Test Series
 Leaders in GATE + ESE Preparation across India
© All rights reserved by Thinkcell Learning Solutions Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission.
15
Numerical Ability
Divisibility by 3
A number is said to be divisible by 3, the sum of its digits is divisible by3
Divisibility by 4
A number is divisible by 4, if the number formed by the last two digits is divisible by 4
Divisibility by 5
A number is divisible by 5, if its units digit is either 0 or 5
Divisibility by 6
A number is divisible by 6, if it is divisible by both 2 and 3
Divisibility by 8
A number is divisible by 8, if the number formed by the last three digits of the given number
is divisible by 8
Divisibility by 9
A number is divisible by 9, if the sum of its digits is divisible by 9
Divisibility by 10
A number is divisible by 10, it its last digit is 0
Divisibility by 11
A number is divisible by 11, if the difference of the sum of its digits at odd places and sum of
its digits at even places is either 0 or a number divisible by 11
Divisibility by 12
A number is divisible by 12, if it is divisible by both 3 and 4
Divisibility by 14
A number is divisible by 14, if it is divisible by 2 as well as 7
Divisibility by 15
A number is divisible by 15, if it is divisible by 3 as well as 5.
Divisibility by 16
If the last 4 digits of a number form a number is divisible by 16, then the number is divisible
by 16
Factor and Multiple of a Number:

If a number x (say) divides another number y exactly, then x is said to a factor of y and y is
said to be a multiple of x
16
Number Systems
Co-Primes or Relatively Primes:

Two or more numbers are said to be relatively prime or co-primes, if they have only „1‟ as a
common factor.
Example: (4, 5), (2, 3), (8, 9)……………..
Number of co-primes of a number less than itself:

If a given number „N‟ is expressed as the product of prime factors written in the form of
N  a p  bq  cr  ds .................. , where a, b, c, d………. are prime numbers, then
The number of co - primes of a number ' N' less than N isgiven by

 1  1  1
N 1   1   1   ............
 a   b  c
N
Sum of all co-primes of N =   Number of co  primes of ' N' less than N 
2
Example 2.1:
Find the number of co-primes to 4320, less than 4320 and also find their sum.
Solution:
Given, N = 4320 = 25 x 33 x 51
Here, a = 2, b = 3, c = 5
 1  1  1
Number of co-primes < 4320 =N  1    1    1  
 a  b  c
 1  1  1
 4320  1   1  3  1  5 
 2    
1 2 4
 4320    = 1152
2 3 5
N
Sum of co - primes   Number of co  primes of N less than N 
2
4320

2
1152  2488320
Number of Factors:
If a given number „N‟ is expressed as the product of prime factors written in the form of
N  a p  bq  cr  ds .................. , where a, b, c, d………. are prime numbers, then
(i) The total number of factors, F(N)= (p+1) (q+1) (r+1) (s+1)…………………
(ii) Number of Odd factors, O(N)= (p+1) (q+1) (r+1) (s+1)…………………..

(Where, a, b, c, d …………must be odd numbers)
17
Numerical Ability
(iii) Number of Even factors, E(N)= F(N)-O(N)
(iv) Number of Prime factors, P(N)= p+q+r+s+ ……………
(v) Number of ways of expressing „N‟ as a product of two numbers

1

2
 (p+1) (q+1) (r+1) (s+1)............................ , if N is not a Perfect square

1
 (p+1) (q+1) (r+1) (s+1)............................  1 , if N is a Perfect square
2 
(vi) Number of ways of expressing „N‟ as a product of two Co-prime numbers= 2n 1

(Where, n is the number of distinct primes of „N‟)
Sum of factors:
a p+1 -1 bq+1 -1 cr+1 -1 bs+1 -1
Sum of factors of N=    .............................
a-1 b-1 c-1 d-1
Example 2.2:
Find the following values for the number 4860.
(1) Number of factors
(2) Number of odd factors
(3) Number of even factors
(4) Number of prime factors
(5) Number of ways of expressing the given number as a product of two numbers.
(6) Number of ways of expressing the given number as a product of two co-primes.
Solution:
Given number, 4860=2 2  35  51
Here a = 2, b = 3; c=5; p = 2; q = 5; r=1
(1) Number of factors=(p+1) (q+1) (r+1)= (2+1) (5+1) (1+1)=36
(2) Number of odd factor=(q+1)(r+1) (5+1) (1+1)=12
(3) Number of even factors=36-12=24
(4) Number of prime factors=2+5+1=8
(5) Number of ways the given number can be expressed as a product of two
1 1
numbers =
2
 (p+1) (q+1) (r+1)  = 2  (2+1) (5+1) (1+1) =18
(6) Number of ways the given number can be expressed as a product of two co-
primes=2n-1=23-1=4
Example 2.3:
Find the number of factors of 420 of the form 5n+2(n  0)
(A) 2 (B) 3 (C) 5 (D) 4
18
Number Systems
Solution:
Given number, 420 can be written as 22  31  51  71
Number of factors =(2+1) (1+1) (1+1) (1+1)=24
Factors are 1,2,3,4,5,6,7,10,12,14,15,20,21,25,28,30,35,42,60,70,105,140,210,420
Of the above factors only 2,7,12 and 42 are of the form 5n+2
Example 2.4:
Find the sum of all factors of 720
Solution:
Given number = 720= 24 x 32 x 51
a p+1 -1 bq+1 -1 c r+1 -1
Sum of factors=   .............................
a-1 b-1 c-1
24+1 -1 32+1 -1 51+1 -1
    2418
2-1 3-1 5-1
HCF and LCM of Numbers:

Highest common factor (H.C.F) or Greatest common divisor (G.C.D): The H.C.F of two or
more than two numbers is the greatest number that divides each of them exactly.
There are two methods to find the HCF of given numbers:

(i) Factorization Method: Write each one of the given numbers as the product of prime
factors and the product of least powers of common prime factors gives H.C.F
(ii) Division method of finding HCF: Divide the greater number with the smaller number
and continue during the divisor with the remainder obtained until we get zero, the
corresponding divisor when zero is obtained, is the HCF of two given numbers.
Example 2.5:
The HCF of 35 and 84 is „7‟
84
35 2
70
35
14  2
28
14
7 2
14
0
Least Common Multiple:

The least number which is exactly divisible by each one of the given numbers is called
L.C.M.
19
Numerical Ability
(I) Factorization Method:

Write each one of the given numbers into a product of prime factors. Then L.C.M is the
product of highest powers of all the factors.
(II) Division Method:

In this method, note that
(i) Always divide by a prime number
(ii) Continues during until only prime number remains
(iii) Continue during until no number is repeated.
Then LCM will be equal to the product of all the divisors.
Example 2.6:
Find the L.C.M of 196 and 280
Solution:
In factorization Method:
196 = 22 × 72
280 = 23 × 51 × 71
So L.C.M of 196 and 280 is 23 × 5 × 72 = 1960
In Division Method:
2 196, 280
2 98, 140
7 49, 70
7 7, 10
2 1, 10
5 1, 5
1, 1
So L.C.M of 196, 280 = 2 × 2 × 7 × 7 × 2 × 5 = 23 × 51 × 72 = 1960
Example 2.7:
A milk vendor has 21 litres of vijaya Milk, 42 litres of jersey milk, and 63 litres of
Heritage milk. He wants to pack them in cans so that each Can contains the same
number of litres of milk, and doesn‟t want to mix any two milk in a can. What is the
least number of cans required?
Solution:
As each can contains the same number litres of milk, so the numbers of litres in each
can is common factor of 21,42 & 63 and it is also the highest common factor since
we need maximum number. of litres in each can.
So number of litres in each can = HCF of 21,42 & 63 = 21 litres
20
Number Systems
Now, number of cans of vijaya milk= 21/21 = 1

Number of cans of Jersy milk = 42/21 = 2
Number of cans of Heritage milk = 63/21 = 3
Hence, the total number of cans required = 1 + 2 + 3 = 6
Example 2.8:
Find the least length of cloth which has to be measured exact number of times using
any of the three measuring roads of lengths 12cm, 15cm and 20cm.
Solution:
In order to find the least length of cloth required, we need to find the L.C.M of 12, 15
& 20
The required length = L.C.M of 12, 15, 20cm = 60cm
Example 2.9:
The H.C.F and L.C.M of two numbers is 18 & 180 respectively. If one of the
numbers is 36, then find the other number.
Solution:
Given H.C.F of two numbers = 18
L.C.M of two numbers = 180
Given one number = 36
18  180
The other number = = 90
36
Example 2.10:
Find the LCM of (45672010 + 1) and (45672010-1)
45674020  1 45672010  1
(A) (B)
2 2
2010 4020
(C) 4567 (D) 4567
Solution:
The units digit of (4567)2010 is same as the units digit of 72010
Now the units digit of 7(4x502 + 2) is 9 (Since units digit of 72 is 9)
 45672010 – 1and 45672010+1 ends with 8 and 0
We can say that they are consecutive even numbers
1
If a and b are two consecutive even numbers then their LCM is ab
2
 The LCM is
 4567 2010

 1 45672010  1  =  4567 4020
1 
2 2
21
Numerical Ability
Example 2.11:
The sum of two numbers is 720 and their HCF is 24. Find the highest possible LCM
of the numbers.
(A) 5848 (B) 5016 (C) 5304 (D) 5924
Solution:
HCF of two numbers = 24; Let the two numbers be 24a and 24b, where a and b are
Co-primes
Given that 24a + 24b = 720  a + b = 30
 (a, b) = (1, 29), (7, 23), (11, 19), (13, 17) { a and b are Co-primes}
 The highest possible LCM of (24a, 24b)=(24 × 13, 24 × 17) = 24 × 13 × 17= 5304
LCM and HCF of fractions:

HCF of numeratons
HCF of fractions =
LCM of Denominators
LCM of Numerators
LCM of fractions =
HCFof Denominators.
Note:
Product of numbers
LCM =
HCF
LCM of three numbers = LCM of (LCM of any two & third)
Example 2.12:
1 2 3 4
Find the LCM and HCF of , , ,
2 3 4 5
Solution:
HCF of 1,2,3,4 1
HCF = =
LCM of 2,3,4,5 60
LCM of Numerators LCM of 1,2,3,4 12
LCM of fractions= = = = 12
HCFof Deno min tors HCF of 2,3,4,5 1
Division Algorithm or Euclidean Algorithm:

Dividend =Quotient x Divisor + Remainder
(i) x n  y n is divisible by(x  y) for all values of n

(ii) x n  y n is divisible by(x  y) for all even values of n
(iii) x n  y n is divisible by(x  y) for all odd values of n
22
Number Systems
Wilson’s theorem
If n is a prime number, then (n – 1)! + 1 is divisible by n.
Example:
Let us take n = 7
Now, (n – 1)! + 1 = 6! + 1 = 721, which is divisible by 7
Example:
Let us take n = 3
Now, (3 – 1)! + 1= 2! + 1 = 3, which is divisible by 3
Fermat Theorem:
If p is a prime number and n is prime to p, then n p 1  1 is divisible by p
Example:
Let, p  5, n  6 5 & 6 are co  primes 
Now, 651  1  1296  1  1295 , which is divisible by 5
Highest power of a prime number in n!
Highest power of a prime p in n! is given by the formula
n  n   n 
  2  3
p p  p 
Where, n is the greatest integer  n
Example 2.13:
Find the highest power of
(i) 3 in 130! (ii) 7 in 2350!
Solution:
(i) Given, n = 130!, p = 3
130  130  130  130  130 
Now, Highest power of 3 =     2    3    4    5   ...............
 3  3  3  3  3 
= 43 + 14 + 4 + 1 + 0= 62
 Highest power of 3 in 130! is 62
(ii) Given, n = 2350, p = 7

 2350   2350   2350   2350 
Highest power of 7=     2    3    4   .............
 7   7   7   7 
= 335 + 47 + 6 + 0= 388
23
Numerical Ability
Highest power of pa in n! is given by the formula =

n   n   n  
     2    3   ....... 
p p  p   , where „a‟ is a natural number
 a 
 
 
Example 2.14:
Find the highest power of 53 in 150!
Solution:
Given, n = 150, p = 5, a=3
 150  150  150  150  
  5    52    53    54    30  6  1  0 
Now, Highest power of 5 =  
3        
  12
 3   3 
 
 
Number of zeroes at the end of a factorial number:
Number of zeroes at the end of n! is given by the formula
n   n   n 
 5    52    53      
     
Example 2.15:
Find the number of zeroes at the end of 135!
Solution:
Given, n = 135!
135  135  135  135 
So,     2    3    4   ..........  27  5  1  0  33
 5  5  5  5 
Binary Number System:

The base of any number system is determined by the number of digits in the system.
Binary: It is a base 2 numeral system and it uses the digits 0,1.
Ternary or trinary:
Ternary is the base 3 numeral system, since it uses three digits 0,1, & 2.
Quaternary Numeral System:

It is base 4 numeral system and it uses the digits 0,1,2 & 3
Quainary Numeral System:

It is a base 5 numeral system, with five numerals from 0 to 4
Senary Numeral System:

If is a base 6 numeral system with six numerals from 0 to 5
24
Number Systems
Septenary Numeral System:

It is a base 7 numeral system with seven numerals from 0 to 6
Octal Numeral System:

Is a base 8 numeral system with 8 numerals from 0 to 7
Nonary Numeral System:

Is a base 9 numeral system with 9 numerals from 0 to 8
Decimal Number System:

It is a base 10 numeral system uses the common 0 through 9 digits. The single digit numbers
0 to 9 make up the set of numbers called units or ones. When the count is higher than 9 the
number is carry forward to tens position. If the number is higher than 99, then it is carried
over to hundreds position and so on. Since it uses ten digits, so it is of base 10
Duodecimal Numeral System:

It is a positional notation numeral system using twelve as its base. In this system, the number
ten may be written as “A” or X, and the number eleven may be written as B or E.
Duodecimal 0 1 2 3 4 5 6 7 8 9 A B
Conversions:
Example 2.16:
Find the value of the Binary number 10011
Solution:
10011 = 1 × 24 + 0 × 23 + 0 × 22 + 1 × 21 + 1 × 20
= 24 + 0 + 0 + 2 + 1 = 19
So 100112 = 1910
Since binary system uses base 2 and so the place values of the digits of a binary
number corresponds to power of 2
Example 2.17:
Convert the Decimal number 18 to Binary number. 2 18
Solution:
2 9-0
Converting Decimal number to Binary is done by simply
dividing the Decimal number by 2 until reach O. the 2 4-1
remainder 1 or O develops Binary number.
 1810  10010 2 2 2–0
1 0
Example 2.18: 1–0
Convert the Decimal number 365 to ternary Number. Conversion of Decimal No. to
ternary is done by dividing the Decimal No with 3
25
Numerical Ability
Solution:
3 365
3 121-2
3 40 - 1
3 13 – 0
3 4–1
1 1
So (365)10 = (111112)3
Conversion of ternary system to Decimal
(111112)3 = 1  35  1  34  1  33  1  32  1  31  2  30
= 243 + 81 + 27 + 3 + 2 = (365)10
Example 2.18:
Convert the Decimal Number 357 to Base 4
Solution:
4 357
4 89 - 1
4 22 - 1
4 5–2
1 1
1–1
So, (357)10 = (11211)4

Conversion of Quarterany system to Decimal
(11211)4 = 1  44  1  43  2  42  1  41  1  40
= 256 + 64 + 32 + 4 + 1 = 357

26

Number Systems: Natural Numbers

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Number Systems: Natural Numbers

Hochgeladen von

Copyright:

Verfügbare Formate

Number Systems

Factor and Multiple of a Number:

Co-Primes or Relatively Primes:

Number of co-primes of a number less than itself:

The number of co - primes of a number ' N' less than N isgiven by

(ii) Number of Odd factors, O(N)= (p+1) (q+1) (r+1) (s+1)…………………..

(iii) Number of Even factors, E(N)= F(N)-O(N)

(iv) Number of Prime factors, P(N)= p+q+r+s+ ……………

(v) Number of ways of expressing „N‟ as a product of two numbers

(vi) Number of ways of expressing „N‟ as a product of two Co-prime numbers= 2n 1

HCF and LCM of Numbers:

There are two methods to find the HCF of given numbers:

Least Common Multiple:

(I) Factorization Method:

(II) Division Method:

So L.C.M of 196, 280 = 2 × 2 × 7 × 7 × 2 × 5 = 23 × 51 × 72 = 1960

Now, number of cans of vijaya milk= 21/21 = 1

LCM and HCF of fractions:

Division Algorithm or Euclidean Algorithm:

(i) x n  y n is divisible by(x  y) for all values of n

(ii) Given, n = 2350, p = 7

Highest power of pa in n! is given by the formula =

Binary Number System:

Quaternary Numeral System:

Quainary Numeral System:

Senary Numeral System:

Septenary Numeral System:

Octal Numeral System:

Nonary Numeral System:

Decimal Number System:

Duodecimal Numeral System:

So, (357)10 = (11211)4

Das könnte Ihnen auch gefallen