Jump to content
Gibson Brands Forums

Math Question


Rocky4

Recommended Posts

You have $1,000 in 1 dollar bills and 10 envelopes. You job is to put the money in the envelopes in different amounts so that, no matter what amount I ask for, you can hand me the amount with a combination of envelopes.

Link to comment
Share on other sites

Trouble is once someone posts the correct answer, the party's over. I solved this quickly, but I'm a geek.

 

I'll give the same clue that was given on the air: one of the envelopes will contain $489

 

you're a Car Talk listener to, I take it

Link to comment
Share on other sites

Wrong! It is binary, but in order for the total to equal 1,000, the last envelope must contain exactly 489, not 512, the difference being 23. If it contains less than that you're short.

 

I think you misunderstood me. I know the solution is a binary solution, but only up to a certain point. That's the part I needed to think about. The point is that you don't need to have all $1,000 in all the envelopes (that is never stated in the original posed problem). That's what took me a moment. Hence, my statement "up to $489 but not necessarily exactly $489." The last envelope only contains what you need to give for what was asked. This happens if he asks for anything between $512 and $1,000. If he asks for $512 then you only need $1 dollar in the last envelope. So I beg to differ when you state it must contain exactly $489.

Link to comment
Share on other sites

Archived

This topic is now archived and is closed to further replies.

×
×
  • Create New...