Find the sum of all positive values of n such that 3 n divides 1 0 0 ! completely.
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.
Please explain to me the theory about this :)
Log in to reply
It is Legendrè's theorem to find the largest power of a prime p that divides n ! . It is given by k ( n ! ) = ∑ i = 1 ∞ [ p i n ] . Here, [ ] denotes the floor or greatest integer function, defined as [ n ] = the greatest integer not exceeding x . Don't get scared about the infinite sum ( Even I got scared unnecessarily when I was new to this !), as at some point p j , 1 ≤ p j < ∞ , the sum becomes zero for every next term. So you gotta identify that point and calculate the sum till there only.
Look here . The idea is the same, except 3 is used here instead of 5 .
Highest power that can divide 100! = k = 1 ∑ ∞ ⌊ 3 k 1 0 0 ⌋ = ⌊ 3 1 0 0 ⌋ + ⌊ 9 1 0 0 ⌋ + ⌊ 2 7 1 0 0 ⌋ + ⌊ 8 1 1 0 0 ⌋ = 3 3 + 1 1 + 3 + 1 = 4 8 So now all we have to do is calculate the sum of all integers from 1 to 48 as follows 1 + 2 + 3 + . . . + 4 8 = 2 4 8 × 4 9 = 1 1 7 6
Problem Loading...
Note Loading...
Set Loading...
We know that the maximum value of n such that 3 n completely divides 100! is
⌊ 3 1 0 0 ⌋ + ⌊ 9 1 0 0 ⌋ + ⌊ 2 7 1 0 0 ⌋ + ⌊ 8 1 1 0 0 ⌋
= 33 + 11 + 3 + 1 = 48.
So, n can vary from 1 to 48.
Therefore, sum of all values of n is 2 4 8 ( 4 8 + 1 ) = 1176