What is the highest power of 7 that can divides without leaving a remainder?
Notation : denotes the factorial notation. For example, .
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.
5 0 0 0 ! = 5 0 0 0 × 4 9 9 9 × 4 9 9 8 × 4 9 9 7 × ⋯ × 1 .
Between 1 and 5 0 0 0 , there are numbers which will be divisible by 7 , 7 2 , 7 3 and 7 4 .
There are ⌊ 7 5 0 0 ⌋ = 7 1 4 numbers that are exactly divisible by 7 between 1 and 5 0 0 0 .
So there are 7 1 4 Sevens contained in these numbers.
There are ⌊ 7 2 5 0 0 ⌋ = 1 0 2 numbers that are exactly divisible by 4 9 between 1 and 5 0 0 0 .
These numbers are also a part of the 7 1 4 numbers. But we add it again because they are divisible by 7 2 and hence to account for the second 7 in these numbers.
There are ⌊ 7 3 5 0 0 ⌋ = 1 4 numbers that are divisible by 3 4 3 (i.e., 7 3 ) between 1 and 5 0 0 0 .
These numbers will be a part of the previous set 7 1 4 and 1 0 2 - however, we add these 1 4 numbers to account for the third 7 in these numbers as these numbers are multiples of 3 4 3 or 7 3 .
And finally, there are ⌊ 7 4 5 0 0 ⌋ = 2 numbers that are divisible by 2 4 0 1 (i.e. 7 4 ).
Therefore, there will be a total of 7 1 4 + 1 0 2 + 1 4 + 2 = 8 3 2 sevens contained in 5 0 0 0 ! . Hence the highest power of 7 that can divide 5 0 0 0 ! without leaving a remainder is 8 3 2 .
In other words, the highest power of 7 (i.e., f ( x ) )that can divide x ! without leaving a remainder is:
f ( x ) f ( 5 0 0 0 ) = a = 1 ∑ ∞ ⌊ 7 a x ⌋ = a = 1 ∑ ∞ ⌊ 7 a 5 0 0 0 ⌋ = ⌊ 7 5 0 0 0 ⌋ + ⌊ 7 2 5 0 0 0 ⌋ + ⌊ 7 3 5 0 0 0 ⌋ + ⌊ 7 4 5 0 0 0 ⌋ = 7 1 4 + 1 0 2 + 1 4 + 2 = 8 3 2