Post by Mocha on Feb 19, 2018 14:17:50 GMT
An easy-to-understand but difficult-to-solve puzzle I made up about a year ago.
What is the smallest number of coins n such that no combination of n coins adds up to $1? (Assuming US legal tender coins)
n must be a natural number; ie. evenly divisible by 1 and positive. No tricky solutions here, you can't have 3/5 of a coin! :^)
If you bruteforced it by writing a computer program, post the code here.
If you solved it manually, post the method you used to eliminate potential solutions.
For those outside the United States, here are the coins you can use:
100 cents = 1 dollar
Again, no tricks, but the final answer will likely surprise you.
What is the smallest number of coins n such that no combination of n coins adds up to $1? (Assuming US legal tender coins)
n must be a natural number; ie. evenly divisible by 1 and positive. No tricky solutions here, you can't have 3/5 of a coin! :^)
If you bruteforced it by writing a computer program, post the code here.
If you solved it manually, post the method you used to eliminate potential solutions.
For those outside the United States, here are the coins you can use:
- 1 cent "Penny"
- 5 cent "Nickel"
- 10 cent "Dime"
- 25 cent "Quarter"
- 50 cent "Half-Dollar"
- $1 "Dollar"
100 cents = 1 dollar
Again, no tricks, but the final answer will likely surprise you.