Problem 52689. Easy Sequences 18: Set Bits of Triple Summations
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
Show
2 older comments
William
on 12 Sep 2021
Hmmm. It's a very clever problem, but I am getting different answers!
ChrisR
on 12 Sep 2021
I am as well. For example, for n = 100, I get 4 (out of 7) bits set.
William
on 12 Sep 2021
Chris -- Yes, exactly.
Ramon Villamangca
on 12 Sep 2021
Let me check. Thanks.
Ramon Villamangca
on 12 Sep 2021
Hi Chris/William,
Should be 'triple summations', sorry for that.
Solution Comments
Show commentsProblem Recent Solvers7
Suggested Problems
-
400 Solvers
-
5357 Solvers
-
Replace pattern 0 1 0 and 1 0 1
144 Solvers
-
Max Change in Consecutive Elements
160 Solvers
-
256 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!