Rank: Unregistered

hi, everybody,
suppose we have n>=3 gold coins either all genuine or exactly one of them is fake. it is not known whether the fake coin is lighter or heavier than the genuine coin. You have a scale that will determin which of the two coins placed is heavier(but not by how much), or if they are both the same weight. The problem is to find if all coins are genuine or not, find the fake coin, and establish if is lighter or heavier.
can anybody prove that any algorithm for this problem must take at least ceiling(log3(2n+1)) weighing in the worst case.
any help will be highly appreciated.
Chris GuoEnter Text To Make Bold Here

Rank: ? (1200)
Member #: 12930

I already had that thing posted as a contest for people, and one person solved here, so here is the link:

http://forums.free2code.net/view.php?tid=29752

Rank: Unregistered

where? I couldn't open that page.
Help...please.

Rank: Unregistered

Hi
Did you solve this problem?

Rank: Unregistered

l couldnt find this solution

Rank: Unregistered

can you help to find it??

Rank: Unregistered

any help will be highly appreciated.But it will be the last tomorroww
hellllp

Rank: ? (779)
Member #: 14565

That link is old. Over 1 year old.