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
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 commentsGroup

Easy Sequences Volume II
- 10 Problems
- 5 Finishers
- Easy Sequences 13: Average Speed of Spaceship
- Easy Sequences 16: Volume of Embedded Octahedron
- Easy Sequences 18: Set Bits of Triple Summations
- Easy Sequences 21: Combinatorial Summations
- Easy Sequences 23: Hat Guessing Game!
- Easy Sequences 24: Number of Coprime Lattice Points
- Easy Sequences 25: Product of Series
- Easy Sequences 31: N-N's Sequence
- Easy Sequences 27: Product of Radicals of Integers
- Easy Sequences 28: Sum of Radicals of Integers
Problem Recent Solvers7
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!