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

Home > Numbers
Power partition procedure (Posted on 2017-03-26) Difficulty: 3 of 5
Number 3 can be expressed as the sum of one or more positive integers in 4 distinct ways:
3; 2 + 1; 1 + 2; 1 + 1 + 1
Number 4 can be expressed as the sum of one or more positive integers in 8 distinct ways:
4; 3 + 1; 1+3; 2 + 2; 2 + 1 + 1; 1+2+1; 1+1+2; 1+1+1+1
Prove : any positive integer n can be so expressed in 2n - 1 ways.

  Submitted by Ady TZIDON    
No Rating
Solution: (Hide)
See jer's 3rd solution - elegance

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Hints/Tipsre: 3rd solution - eleganceAdy TZIDON2017-03-27 01:21:47
Solution3rd solution - eleganceJer2017-03-26 21:31:02
Hints/Tipsre: Another solutionAdy TZIDON2017-03-26 17:34:37
SolutionAnother solutionJer2017-03-26 14:33:59
SolutionOne solutionJer2017-03-26 14:26:21
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 (1)
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