Find the greatest integer 'n' such that (42)^n divides 2007!
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.
Since 4 2 = 2 × 3 × 7 , we need to find the numbers of 2 's, 3 's and 7 's (i.e. the index of them) in the prime factorization of 2 0 0 7 ! , then find the least amongst the three. Trivially, the number of 7 's should be the least. This is achieved by ⌊ 7 1 2 0 0 7 ⌋ + ⌊ 7 2 2 0 0 7 ⌋ + ⌊ 7 3 2 0 0 7 ⌋ + ⋯ = 2 8 6 + 4 0 + 5 = 3 3 1 , because the number of numbers divisible by 7 under 2 0 0 7 is 2 8 6 , then for each 4 9 numbers we have an additional 7 in the prime factorization of 2 0 0 7 ! , and so on.