Académique Documents
Professionnel Documents
Culture Documents
com
NUMBER THEORY
PART - I
Maximum Power Of a Number Dividing a Given Factorial Factors Congruent Modulo N Base System
Alternate Method
5
5 5
60
12 2 0
Adding we get 14
4
4
24
6 1 Adding we get 7
Explanation
24! = 1 x 2 x 3 24 contains 4 8 12 16 20 24 ( 6 in numbers) As 16 is divisible by 4 twice therefore we get 7 as an answer
BUT
24! contains 2 & 6 also which are not divisible by 4 But 2 x 6 is divisible by 4. Similarly 10 x 14 , 18 x 22 etc
How to do?
Find the highest power of 22 that can divide 24!
Earlier,the divisor given was prime number but 4 is not a prime number 4 can be written as 22
24
2
2
12
6 3 1 Adding we get
22
Number of zeros in n!
# Find the number of zeros in the end of 75! Or # Find the highest power of 10 that can divide 75! Funda Numbers of zeros depend upon number of 5s and 2s (10 = 2 X 5). So calculate maximum power of 5 dividing 75! 5 5 75 15 3 Adding we get 18 So 75! has 18 zeros at the end.
Factorization Trees
If a number n is not prime, we must be able to break it down to a product of prime numbers. Here is how, 60 60 6
2 3
10 2 5
Or
30
5 6
2 3 However, the collection of prime numbers we get from the leaves of the tree is always the same. In other words, 60 = 2 2 3 5 no matter how we factorize it.
Factors
Factors of 24 24 = 1 24 2 12 38 46 So the list of all factors of 24 is 1, 2, 3, 4, 6, 8, 12, 24
Numbers of Factors
Let us consider a number X which can be written as X = pa qb rc
Where p, q, and r are prime factor of the number and a, b, and c are Natural number.
24 23 31
To do this, use the prime factors themselves. Write the powers of each of the prime factors beginning with 0 and going to the power of the factor in the prime factored form.
2 ,2 ,2 ,2 and 3 0 ,31
The sum of these are formed for each of the prime factors and then the product of these sums in 0 1 2 3 0 1 found.
Wilsons Theorem
If n is a prime number, (n 1)! + 1 is divisible by n. Example Lets take, n = 5 Then (n 1)! + 1 = 4! + 1 = 24 + 1 = 25, which is divisible by 5. Similarly if n = 7 (n 1)! + 1 = 6! + 1 = 720 + 1 = 721 which is divisible by 7.
Fermats Theorem
If p is a prime number and N is prime to p, then Np-1 1 is divisible by p.
Base System
What we are doing up to now we were doing on decimal base system. But other than this we have many other base system depending upon the number of initial digits used in, as in decimal base we use 10 digits (0,1,2,..9).
Types of Base System (1) Binary : It consist of only two digits 0 & 1. (2) Octal : It has only 8 digits in it 0, 1, 2, 3, 4, 5, 6 & 7. (3) Decimal: It is the commonly used base having 10 initial digits as 0, 1, 2, 3, 4, 5, 6, 7, 8 & 9. (4) Hexadecimal: It has 16 digits in it. these digits are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E and F.
Base System
There can be following three types of questions
Converting from any base to decimal base Converting from decimal to any base Converting from one base to another (Other than decimal base system)
Base System
Converting from decimal to any base Convert abcd10 from decimal to N base. Example Convert 433010 from decimal to base 8. 8 4330 8 541 - 2 8 8 67 - 5 8 - 3
N abcd N Q1 - s N Q2 - r N p - q
(pqrs)N
- 0
(10352)8
Base System
Converting from any base to decimal base Lets take the number as (abcd)N where a,b,c & d are the different digits and N is the base. Number in decimal system = axN3 + bxN2 + cxN1 + dxN0 Example What is the decimal equivalent of the number (2134)5?
Base System
Converting from one base to another
First base
Decimal
Second base
Example
Convert the number 1982 from base 10 to base 12. The result is a. 1182 b. 1912 c. 1192 d. 1292
(CAT 1999)
Thank you
Any Question??