Let N = 1 ! ⋅ 2 ! ⋅ 3 ! ⋅ 4 ! … 9 ! ⋅ 1 0 ! . Let 2 k be the largest power of 2 that divides N . What is the value of k ?
Details and assumptions
n ! = n × ( n − 1 ) × ( n − 2 ) … 2 × 1 .
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.
You can also expand the factorial: N = 1 ! ⋅ 2 ! ⋅ 3 ! ⋅ . . . . 9 ! ⋅ 1 0 ! which simplifies to N = 1 1 0 ⋅ 2 9 ⋅ 3 8 ⋅ . . . . . ⋅ 9 2 ⋅ 1 0
Prime factor the product and add up all the powers of 2 will give us 2 3 8 and some other numbers. Therefore k = 3 8
Problem Loading...
Note Loading...
Set Loading...
Clearly 2 , 4 , 6 , 8 , 1 0 are the only numbers that contain a factor of 2 . We break this up into the number of times each of 2 , 4 , 6 , 8 , 1 0 appears in the expression: N = 1 ⋅ ( 1 × 2 ) ⋅ ( 1 × 2 × 3 ) … ( 1 × 2 × 3 … × 1 0 ) .
2 appears in 2 ! , 3 ! , … , 9 ! , 1 0 ! , thus there are 9 2 ′ s . Since 2 = 2 ⋅ 1 , thus it contributes 9 factors of 2 .
4 appears in 4 ! , 5 ! , … , 9 ! , 1 0 ! , thus there are 7 4 ′ s . Since 4 = 2 2 , thus it contributes 1 4 factors of 2 .
6 appears in 6 ! , 7 ! , … , 9 ! , 1 0 ! , thus there are 5 6 ′ s . Since 6 = 2 ⋅ 3 , thus it contributes 5 factors of 2 .
8 appears in 8 ! , 9 ! , 1 0 ! , thus there are 3 8 ′ s . Since 8 = 2 3 , thus it contributes 9 factors of 2 .
1 0 appears in 1 0 ! , thus there is only one 1 0 . Since 1 0 = 2 ⋅ 5 , thus it contributes 1 factor of 2 .
Therefore there are 9 + 1 4 + 5 + 9 + 1 = 3 8 factors of 2 in N . Hence 2 3 8 is the largest power of 2 that divides N .