# Tag Info

## Hot answers tagged weighing

Accepted

• 16.6k
Accepted

• 279
Accepted

### Minimum number of turns

Oo, I've got this one; these come up a lot while organising board game tournaments. a) what is the minimum number of turns needed to determine the heaviest box? b) what is the min number of turns ...
• 77.7k

• 291

### Seven genuine and two fake coins

Here is a method. Let's name the coins ABC DEF GHI.
• 30.6k
Accepted

### Minimum K for detecting fake pearls in one weighing

As others have shown, it suffices to find a $10$-set whose $2^{10}$ subsets have distinct sums, and we want to minimize the maximum element of this $10$-set. An upper bound from https://oeis.org/...
• 14.1k

### Determine whether the counterfeit coin is heavier or lighter in two weighings on a standard balance

Here's a complete set of solutions for arbitrarily many coins to a more restrictive version of the problem, where the second weighing is not allowed to depend on the result of the first. This gives ...
• 151
Accepted

### How many solutions to the twelve coins problem are there?

I have an answer to the non-adaptive version of the problem, that is, the version where one must declare ahead of time all three weighings one will perform, and their algorithm is not allowed to ...
• 2,389

### Minimum K for detecting fake pearls in one weighing

Instead of $K=512$, I suppose that already is enough (and perhaps the best possible choice). I make use of a special property of the set With positive integers $a$ and $b$ specified below, set If \$...
Accepted

### Designing a four-pan scale

Here is my solution. I do not know if this is optimal or not. Here is the method. Proof of Lemma:
• 32.5k
Accepted

### 14 coins problem but you can't understand the scale

If each coin is given by a different lower-case letter, you could use these tests: More coins can't be done because: Comments:
• 3,326

### Minimum K for detecting fake pearls in one weighing

To add to what @HaganvonEitzen said in their answer, I have found a slightly smaller set that is solved in the same way. I have no clue if this is the minimum however.

### Minimum K for detecting fake pearls in one weighing

I think you need at least pearls per box. You grab and put these all together on the scale to get some weight x. You have a total of pearls and now compute
• 1,863
Accepted

### Centridipity problem

In the frame of the car, there are two forces: gravity pointing down, and centrifugal pointing to the right. In effect, we can analyze physics in the frame of the car by pretending like there is an ...
• 1,044

### Finding the median mass: is there a general solution for 2n + 1 objects?

Short answer to the question in the title: No. A bit longer answer: We, as the humanity, don't know if an optimal general method exists, and certainly not what it might be. Even longer answer still: ...
• 77.7k

• 4,387
1 vote

### Find the heaviest and the second heaviest coins

Assuming you can fit more than 1 coin on each side: Split the 32 in two groups (of 16) and determine heaviest side Take heaviest side, split in two groups (8) and determine heaviest side Repeat (4), ...
1 vote

### Minimum K for detecting fake pearls in one weighing

An easily found decent? upper bound
• 9,238

Only top scored, non community-wiki answers of a minimum length are eligible