I am trying to understand the following question, and honestly have no idea from where to start it seems like it asking for factorial of $n$ terms in a form of $g(n)$?
Define $g(n):=f(n!)$. We want to find a closed formula for $g(n)$. First of all, we want to find a recurrence for $g(n)$. If n is odd, then it is pretty easy to see that $g(n)=g(n−1)$. If n is even, try to write $g(n)$ in terms of $g(n/2)$.
Can someone help thanks.
That the only definition of f given
That the only definition of f I have from above question which basically like a remainder of 0 in a binary number like how many 0 are after last 1