Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: coins problem
Replies: 7   Last Post: Jun 16, 2009 10:34 PM

 Messages: [ Previous | Next ]
 Helena Verrill Posts: 8 Registered: 12/6/04
Re: coins problem
Posted: Feb 1, 1999 5:09 AM

John Conway wrote:
>
> Here's the solution to the n-weighing version of this problem that

...

> Neat, isn't it?

Yes, it's very nice, thank you.

By the way, you said that an information count would make you
think you could do (3^n-1)/2 --- I suppose you mean that there are 3
possibilities for weighing, so n weighing gives 3^n outcomes,
and k coins means 2k possibilitis, (anyone light or heavy),
so, max k has 2k=3^n, and since that k is not an integer, you get
(3^n-1)/2.... so how do you prove you can't do this many?
And why is it, that if you just have the extra information
that you know the odd coin is light, then the 'information
count' does work, and you can do 3^n in n weightings?
what's the difference?

Date Subject Author
1/27/99 Helena Verrill
1/27/99 Sarah Seastone
1/27/99 Brendan
1/27/99 John Conway
1/28/99 John Conway
2/1/99 Helena Verrill
2/1/99 John Conway
6/16/09 Barco You