if you have 11 coins, and you have weighing machine.
all it can say, if left side is heavier, equal, lighter compared to right side.
one of those coins, is little bit heavier, and you're allowed to use only the weighing machine.
every other coin has equal weight
what is the minimum amount of moves, in order to find that coin, to find it everytime?
if you want harder version, find for n > 10 coins, general formula.
this isn't a homework, just math for fun.
I want a solid reasoning behind it, rather than answer.
because that's fun part in math, the solving part.
Hmm interesting puzzle