Define g(n): =f( we want to find a closed formula for g(n)g(n). first of all, we want to find a recurrence for g(n)g(n). if nn is odd, then it is pretty easy to see that g(n) = g(n-1)g(n)=g(n−1). if nn is even, try to write g(n)g(n) in terms of g(n/2)g(n/2).

Step-by-step explanation:

Notice that the odd factors of above equality don't contribute to the largest power of 2 that divides (2k+1)!

Therefore, we can conclude that .

Notice that the odd factors of above equality don't contribute to the largest power of 2 that divides (2k)!

Hence,

So for ,

wedfghjkl;

tyuiop[]ghjkl;

step-by-step explanatio89