Back to Archive
#82discrete
hard

Weights Reckoning

Source: leino

We have a beam balance (with two pans to compare weights) and a positive integer N. How do we select fewest number of pebbles to weigh all possible integers from 1 to N

Discussion

0

You must be logged in to participate in the discussion.

No comments yet. Be the first to start the conversation!