Find a simple partition P[n]. E.g. P[10] = 4 + 3 + 2 + 1.
- There are many solutions, compute just one set.
- Don't repeat numbers.
- Be Greedy ;-)
- To check against trivial solutions, E.g. [x-k, k] etc; but I'll provide you with one to start.
- Show me how you write the whole solution.
Bonus points if you solve the general problem of producing all unique partitions of [n].
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers34
Suggested Problems
-
Find the alphabetic word product
3468 Solvers
-
Equidistant numbers containing certain value in an interval
91 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
589 Solvers
-
100 Solvers
-
Getting the indices from a matrix
729 Solvers
More from this Author10
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Maybe you should say that the partition must have size greater than ceil(log2(x)/2)), since you test this at the test suite. The total number of partitions that a number has may be huge, even if we consider only unique sets (ignoring the order): a sum of binomial coefficients from 1 to the number-1 (where there is only one possible set of ones).