Complex Problems

Cash for a Car ★★★

Thanks to Lucas Jones, we can present you the following puzzle:

A man is going to an Antique Car auction. All purchases must be paid for in cash. He goes to the bank and draws out $25,000.

Since the man does not want to be seen carrying that much money, he places it in 15 envelopes numbered 1 through 15, in such a way that he can pay any amount up to $25,000 without having to open any envelope. Each envelope contains the least number of bills possible of any available US currency (for example, no two tens instead of a twenty).

At the auction, he makes a successful bid of $8322 for a car. He hands the auctioneer envelopes 2, 8, and 14. After opening the envelopes, the auctioneer finds exactly the right amount.

The question: How many ones did the auctioneer find in the envelopes?

The answer: Click here!

This website uses cookies. By further use of this website, or by clicking on 'Continue', you give permission for the use of cookies. If you want more information, look at our cookie policy.