Define g(n):=f(n!). We want to find a closed formula for g(n)g(n). First of all, we want to find a recurrence for g(n).

3. Forn N, let w(n) denote the number of ls in the binary representation of n. For example, w(9) = 2, since $95 is 1001 in binary. Try to find a closed formula for g(n) in terms of n and w(n). If you succeed, the following question will be very easy. Let n = 10000000000000011 in binary notation. What is g(n)? Write your answer in binary! Preview will appear here