Problem #PRU-100362

Problems Discrete Mathematics Set theory and logic Mathematical logic

Problem

Suppose you had eight billiard balls, the recruiter began. One of them is slightly heavier, but the only way to tell is by put-ting it on a scale against the others. What’s the fewest number of times you’d have to use the scale to find the heavier ball?