I'm now stuck with this question, and I don't even know where to start: Find sum of series
, where f(n) - number of ones in binary representation of n.
I wish I could post some moves, that I've tried but I don't know what to do.
How to simplify this without using fractions in the power? We didn't learn to rationalize with fractions in our school.