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

Home > Numbers
Tricky sums indeed! (Posted on 2019-10-10) Difficulty: 3 of 5
Let the function O(n) denote the sum of natural numbers, i, less than or equal to n. However, this function has one trick - if the number to be added, i, is a power of 2, then instead of adding we subtract the number.

Find O(4)+O(5)+O(6)+...+O(10000)

No Solution Yet Submitted by Danish Ahmed Khan    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionComputer aided solutionLarry2019-10-14 18:00:07
SolutionSolutionBrian Smith2019-10-13 01:04:45
Solutioncomputer-aided solutionCharlie2019-10-10 12:08:48
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information