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

Home > Numbers
Divide et impera part two (Posted on 2015-08-26) Difficulty: 3 of 5
Divide et impera asked to divide the set of integers from 1 to 15 into two subsets A & B, so that the sum of the numbers in A equals the product of the numbers in B.

Instead of an upper limit of 15, use n to stand for any positive integer.

Find, with proof for what values of n the task is possible?

No Solution Yet Submitted by Jer    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
solutionxdog2015-08-26 18:26:37
Some ThoughtsMuch data but no proof--computer explorationCharlie2015-08-26 12:58:28
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 (10)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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