The function S(n) is defined by the following triple summations:
The double brackets mean that the output of the triple summations is being rounded-off to the nearest integer. Write the function 'bitS(n)', which is the number of bits set in the binary representation of S(n).
Solution Stats
Problem Comments
5 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers10
Suggested Problems
-
424 Solvers
-
1072 Solvers
-
Not square-free number sequence
84 Solvers
-
260 Solvers
-
Easy Sequences 3: Prime 44-number Squares
37 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Hmmm. It's a very clever problem, but I am getting different answers!
I am as well. For example, for n = 100, I get 4 (out of 7) bits set.
Chris -- Yes, exactly.
Let me check. Thanks.
Hi Chris/William,
Should be 'triple summations', sorry for that.