Problem 1873. Break it up! Break it up!

Created by James

Solve Later

You have N pennies. Write a Matlab script that will reveal how many different ways you can break up those pennies. For example, with 5 pennies, there are seven different ways you can divide them:

(1,1,1,1,1)
(2,1,1,1)
(2,2,1)
(3,2)
(3,1,1)
(4,1)
(5)

The order of the coins does not matter, so (2,2,1) is considered the same combination as (2,1,2). You can assume that N will always be a positive integer.

Solve

Solution Stats

117 Solutions
54 Solvers

Last Solution submitted on Jul 18, 2024

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

Tim on 17 Sep 2013

Test case p(300)=9253082936723604 exceeds the maximum integer that can be represented exactly as a double precision number (namely, 2^53=9007199254740992); the fact that some solutions work for this case is just luck.

James on 18 Sep 2013

Changed to p(299), which is <2^53. Thanks for the heads up.

James on 18 Sep 2013

Interestingly, p(299) had some issues as well. Changed again to p(199), which seems to be working OK.

ChrisR on 23 Apr 2022

If I ever want to learn something, I dial up a problem from James.

Solution Comments

Show comments

Problem Recent Solvers54

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1873. Break it up! Break it up!

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers54

Suggested Problems

More from this Author80

Problem Tags

Community Treasure Hunt

Problem 1873. Break it up! Break it up!

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers54

Suggested Problems

More from this Author80

Problem Tags

Community Treasure Hunt

Players