perplexus.info :: Just Math : Digital sum

Digital sum (Posted on 2005-08-20)

For each positive integer n, let A(n) be the number of digits in the binary representation of n, and let B(n) be the number of ones in the binary representation of n. What is the value of S:

S = (1/2)^[A(1)+B(1)] + (1/2)^[A(2)+B(2)] + (1/2)^[A(3)+B(3)] + ...

See The Solution Submitted by pcbouhid

Rating: 4.4000 (5 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

re: Great problem -- and comments!

| Comment 7 of 8 |

(In reply to Great problem -- and comments! by Rebecca Jaffe)

Very nice of you, Rebecca. Tk you. Prepare yourself!

Posted by pcbouhid on 2005-08-30 14:38:40

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info