Number System: Finding Maximum power of a number divide a factorial number

To find the maximum power of a number which divides a factorial number, we need to consider how many of these numbers contained in the factorial.

Solved Example 1:
The maximum power of 5 in 60!
Sol: 60! = 1 x 2 x 3 ..................60 so every fifth number is a multiple of 5.  So there must be 60/5 = 12
In addition to this 25 and 50 contribute another two 5's. so total number is 12 + 2 = 14
Short cut: [605]+[6052]=12+2=14
Here [ ] Indicates greatest integer function.
Shortcut:
Divide 60 by 5 and write quotient.  Omit any remainders. Again divide the quotient by 5. Omit any remainder.  Follow the procedure, till the quotient not divisible further. Add all the numbers below the given number. The result is the answer.

Solved Example 2:
Find the highest power of 12 that divide 49!.
Sol: We should commit to the memory that the above method is applicable only to prime numbers.  So we should write 12 in its prime factors. 12 = 22×3

We find the maximum power of 2 in 49! = 492+494+498+4916+4932 = 24 + 12 + 6 + 3 + 1 = 46

So maximum power of 22 in 49! is 23.

Now we find the maximum power of 3 in 49! = 493+499+4927=16+5+1=22
49!=(22)23×322×someK

So 22 is the maximum power of 12 that divides 49! exactly.

Solved Example 3:

How many zero's are there at the end of 100!

Sol: A zero can be formed by the multiplication of 5 and 2. Since 100! contains more 2's than 5's, we can find the maximum power of 5 contained in 100!

For your understanding:
1002+1004+1008+10016+10032+10064 = 50 + 25 + 12 + 6 + 3 + 1 = 97

1005+10025=20+4=24
So there are 24 zero's at the end of 100!

Solved Example 4:
By which number the expression 200!12100 should be multiplied so that the given expression becomes an integer
Sol: 12100 = 4100×3100 = 2200×3100
Now we have to find the maximum power of 2 and 3 in numerator.
200!12200=2197×397×....2200×3100
To divide the numerator, we need to multiply it with 23×33=216


Solved Example 5:
What is the maximum power of 3 in the expansion of 1! × 2! × 3! × . . . . × 100!
Sol: Given 1! × 2! × 3! × . . . . × 100!.  We rewrite this expression by writing as 1100 × 299 × 398 × . . . × 100
This is possible as each term contains 1. From 2! on wards each term contains 2. So they are total 99. Similarly, only last term contains 100. So it has power of 1.
Now we have to calculate number of 3's.
398, 695, 992. . ., 992
Observer here the power and base sum = 101. So it is easy to form this series.
Total powers of 3 = 98 + 95 + 92 + . . . . + 2
Number of terms = lad+1 = 9823+1 = 33
Sum = n2(a+l) = 332(98+2) = 1650
Also, the powers of 9's, 18's, 27's contains another 3.  They contribute more number of 3's.
So 992, 1883, 2774. . ., 992
Number of terms = lad+1 = 9229+1 = 11
Sum = n2(a+l) = 112(2+92) =  517
Also, the powers of 27's, 54's, 81's contains another 3.
So 2774, 5447, 8120
Their sum = 74 + 47 + 20 = 141
Finally, power of 81 contains another 3. So it contributes another 20.
Total = 1650 + 517 + 141 + 20 = 2328.

No comments:

Post a Comment