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
-
Maximum running product for a string of numbers
2258 Solvers
-
Multiples of a Number in a Given Range
946 Solvers
-
Convert a Cell Array into an Array
2341 Solvers
-
547 Solvers
-
Find the next Fibonacci number
930 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.