Multiplication of Factorials

Algebra Level pending

Let N ! = 1 ! 2 ! 3 ! . . . . . 10 ! N!=1!\cdot 2!\cdot 3!\cdot .....\cdot 10! where ! ! is factorial symbol. Let k k be the greatest power of 2 2 such that N N is divisible by 2 k { 2 }^{ k } . Compute k k .


The answer is 38.

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.

1 solution

William Isoroku
Dec 5, 2014

Expanding N N gives us N = 1 2 9 3 8 4 7 5 6 6 5 7 4 8 3 9 2 10 N=1\cdot { 2 }^{ 9 }\cdot { 3 }^{ 8 }\cdot { 4 }^{ 7 }\cdot { 5 }^{ 6 }\cdot { 6 }^{ 5 }\cdot { 7 }^{ 4 }\cdot { 8 }^{ 3 }\cdot { 9 }^{ 2 }\cdot 10

Prime factor it gives us N = 2 38 . . . . . . . N={ 2 }^{ 38 }\cdot .......

....... are basically other prime factors.

So the greatest power of 2 2 , or the greatest value of k k is 38 \boxed {38}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...