Find the largest integer k such that k 2 is a factor of 1 0 ! .
Notation : ! denotes the factorial notation.
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.
same way exactly
Log in to reply
this is the basic way
It's easy to see why 1 will be the power of 7 (hint: 7 ⋅ 2 > 1 0 ). So we just find the powers of primes less than 7.
Highest power of 2 -
⌊ 2 1 0 ⌋ + ⌊ 4 1 0 ⌋ + ⌊ 8 1 0 ⌋ = 8
Highest power of 3 -
⌊ 3 1 0 ⌋ + ⌊ 9 1 0 ⌋ = 4
Highest power of 5 -
⌊ 5 1 0 ⌋ = 2
So we have the factorization as 2 8 ⋅ 3 4 ⋅ 5 2 = ( 2 4 ⋅ 3 2 ⋅ 5 ) 2 = 7 2 0 2
Good explanation which shows how to generalize to larger values.
Show 1 0 ! as a product of it's prime factors.
1 0 ! = 1 0 × 9 × 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1
= ( 5 × 2 ) × ( 3 × 3 ) × ( 2 × 2 × 2 ) × 7 × ( 2 × 3 ) × 5 × ( 2 × 2 ) × 3
= 2 8 × 3 4 × 5 2 × 7
= ( 2 4 × 3 2 × 5 1 ) 2 × 7
Hence the largest possible k for which k 2 ∣ 1 0 ! is k = 2 4 × 3 2 × 5 = 7 2 0
That's a wonderful and little bit tricky question.But I have found its answer,which is 720 Since 720*720 *7=3628800=10! where "7" being the least factor (integer) whose product with the square of required number (720) gives 10!
1 0 ! = 2 8 ⋅ 5 2 ⋅ 3 5 ⋅ 7 ⋅ 1
Problem Loading...
Note Loading...
Set Loading...
10! = 2 * 5 * 3 2 * 2 3 * 7 * (2 * 3) * 5 * 2 2 * 3 * 2 = 2 8 * 3 4 * 5 2 * 7 = ( 2 4 * 3 2 * 5) 2 * 7
Therefore k = 2 4 * 3 2 * 5 = 7 2 0