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: ( You must be logged in to post comments.)

Subject	Author	Date
Puzzle Answer	K Sengupta	2022-05-26 23:00:31
re: Great problem -- and comments!	pcbouhid	2005-08-30 14:38:40
Great problem -- and comments!	Rebecca Jaffe	2005-08-30 03:16:20
Chunking A(n) -- Simplified	Gamer	2005-08-21 04:11:25
Chunking A(n) -- Explained	Gamer	2005-08-21 04:11:13
re: Suspicions confirmed	Josh70679	2005-08-20 21:19:56
Suspicions confirmed	Paul	2005-08-20 20:32:01
Looks suspiciously close to ...	Charlie	2005-08-20 18:54:22

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