All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Digital sum (Posted on 2005-08-20) Difficulty: 2 of 5
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.2500 (4 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re: Great problem -- and comments!pcbouhid2005-08-30 14:38:40
Great problem -- and comments!Rebecca Jaffe2005-08-30 03:16:20
Chunking A(n) -- SimplifiedGamer2005-08-21 04:11:25
Chunking A(n) -- ExplainedGamer2005-08-21 04:11:13
re: Suspicions confirmedJosh706792005-08-20 21:19:56
SolutionSuspicions confirmedPaul2005-08-20 20:32:01
Some ThoughtsLooks suspiciously close to ...Charlie2005-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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2017 by Animus Pactum Consulting. All rights reserved. Privacy Information