Find the highest power of 3 that divides 7 0 ! .
Notation
:
!
denotes the
factorial
notation. For example,
1
0
!
=
1
×
2
×
3
×
⋯
×
1
0
.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We know 7 0 ! = 1 × 2 × 3 × 4 . . . . 7 0
Now, since we need to find the power of 3 let us rearrange the above product by writing all the multiples of 3 together.
7 0 ! = ( 3 × 6 × 9 × 1 2 . . . . 6 9 ) ( 1 × 2 × 4 × 5 × 7 . . . 7 0 )
Now write the multiples of 3 (That we have rearranged and wrote together above) in the form of 3 n
7 0 ! = ( ( 3 × 1 ) ( 3 × 2 ) ( 3 × 4 ) . . . ( 3 × 2 3 ) ) ( 1 × 2 × 4 . . . 7 0 )
Now collect all the 3 ′ s together..
7 0 ! = ( 3 2 3 ) ( 1 × 2 × 3 × 4 × 5 . . . 2 3 ) ( 1 × 2 . . . 7 0 )
Now again the 2 n d bracket can be rearranged and all the multiples of 3 can be written together...
7 0 ! = ( 3 2 3 ) ( 3 × 6 × 9 × 1 2 × . . . 2 1 ) ( 1 × 2 × 3 . . 2 3 ) ( 1 × 2 × 4 . . . 7 0 )
Once again write the 2 n d bracket in the form of 3 n and collect all the 3 ′ s together.
7 0 ! = ( 3 2 3 ) ( 3 7 ) ( 1 × 2 × 3 × 4 . . . 7 ) ( 1 × 2 × 4 . . . 2 3 ) ( 1 × 2 × 4 . . . 7 0 )
7 0 ! = ( 3 3 0 ) ( 1 × 2 × 3 × 4 . . . 7 ) ( . . . . . . . . ) ( . . . . . . . . )
Following the same method the 2 n d bracket can be written as
7 0 ! = ( 3 3 0 ) ( 3 × 6 ) ( 1 × 2 × 4 × 5 × 7 ) ( . . . . . . . . ) ( . . . . . . . . )
7 0 ! = ( 3 3 2 ) ( 1 × 2 ) ( . . . . . . . ) ( . . . . . . . ) ( . . . . . . . )
Hence the highest power of 3 in 7 0 ! is 3 2
I think this is what you meant!
Exactly. That is the intuitive approach behind the formula.
And the explanation is good too!(+1)
Problem Loading...
Note Loading...
Set Loading...
Method 1 : Direct formula
Let p be a prime number.
The highest power of p that divides n ! is given by,
i = 1 ∑ ∞ ⌊ p i n ⌋ which directly gives us 32 when we substitute n = 7 0 , p = 3
Method 2 : Intuitive approach
The powers of 3 dividing 70! are contributed by multiples of 3.
There are 23 multiples of 3 lesser than 70.
These contribute 23 powers.
But, 7 of them are multiples of 9, which contribute 2 powers each, out which one has already been accounted for. So, we add 7 to the previous count which gives us 30.
Now, 2 of the multiples of 3, were also multiples of 27, ( 2 7 , 5 4 ) and contribute 3 powers of 3 each, out which 2 have already been accounted for. So we add another 2. Final count : 32.
The intuitive approach is basically how the formula has been derived.
Sorry for the bad explanation .