---
title: "Numbers in Balance"
id: "2254"
type: "post"
slug: "numbers-balance"
published_at: "2026-10-20T03:06:16+00:00"
modified_at: "2026-11-08T03:54:03+00:00"
url: "https://omnimathpuzzles.com/numbers-balance/"
markdown_url: "https://omnimathpuzzles.com/numbers-balance.md"
excerpt: "Some number systems make certain patterns easier to recognize, calculations more convenient to perform, or mathematical relationships more readily accessible. A change in notation can therefore become a change in perspective—and sometimes, that is precisely what a problem needs"
taxonomy_category:
  - "Number theory"
---

> “*Mathematics is the art of giving the same name to different things.*”— Henri Poincaré, The Future of Mathematics (1908).

## Introduction

Now and then, a social media post divides the internet by suggesting that, in some number systems, certain equations are true while in others they are not, as evidence that the laws of arithmetic vary by context or even by culture. But, of course, the same old arithmetic lies behind every number system! These systems are simply different ways of representing the same numbers, like languages: there is no contradiction between French and English; both are valid ways to conceptualize and communicate the facts of the world around us.

Two plus three is always five, regardless of the number base in which we choose to express it. What changes is the notation: in base five, for instance, the sum is written 10510_5, while in base four it is written 114.11_4. The underlying quantity remains the same, and we can translate exactly from one **positional system** to another. Yet the choice of representation is more than a matter of appearance. Some number systems make certain patterns easier to recognize, calculations more convenient to perform, or mathematical relationships more readily accessible. A change in notation can therefore become a change in perspective—and sometimes, that is precisely what a problem needs.

Consider, for example, the following puzzle, which is a peculiar variation on the familiar weighing puzzle. You might start playing around, maybe even solve it by trial and error, but can you find a number system that makes this problem a lot easier?

### A Weighing Puzzle

The illustration below shows a simple scale for weighing objects. The scale consists of a lever resting on a fulcrum with weighing pans at each end of the lever, equidistant from the fulcrum. Suppose the objects to be weighed may range in weight from 11 pound to 100100 pounds at one-pound intervals: 1,2,3,...,98,99,100.1, 2, 3, …, 98, 99, 100. After placing one such object on either of the two weighing pans, one or more precalibrated weights are then placed in either or both pans until balance is achieved, thus determining the weight of the object. If the relative positions of the lever, fulcrum, and pans may not be changed, and if one may not add to the initial set of precalibrated weights, what is the **minimum number** of such precalibrated weights that would be sufficient to bring into balance any of these one hundred objects?[1](#4d282c3a-c512-4037-a3f6-c5b2bf91f524)

Figure 1. AI-generated Image

#### Hint

Reveal Hint Don’t think of each weight as simply being used or unused. Since a weight can be placed on either pan or left aside, **it has three possible states**. Can you translate these three possibilities into numerical values and identify a number system that makes use of them?

#### Solution

Reveal solution On a balance scale, where you may put each precalibrated weight (referred to as “weights” hereafter) on the same pan as the object (to subtract) or on the opposite pan (to add), each weight has three “states”: “**not used**“, “**placed with the object”**, or “**placed against the object**“. Assume there are nn such weights, where n∈ℤ+n\in \mathbb{Z^{+}}. Since each weight can be in three possible states, by the multiplication principle, there are 3n3^{n} possible combinations of weight placements. Accordingly, we can reframe this problem as one of**balanced ternary representation**by assigning values from the set {−1,0,1}\{ -1,0,1 \} to each weight state:

1. −1-1 if the weight is placed with the object (say, on the right pan)
2. 00 if the weight is not used (on neither pan)
3. 11 if the weight is placed against the object (say, on the left pan)

 The signs depend on which side of the scale we choose as positive, but the essential idea is that a weight can either add to or subtract from the object’s weight. For example, suppose the available weights are 11 and 33 pounds. Can we weigh an object of 22 pounds? Yes! Put the 33-pound weight opposite the object and the 11-pound weight alongside it: 2=3−12=3-1

 Furthermore, the weight of any object to be weighed may be written as a unique sum of powers of 33. Thus, for weights 1,3,9,...,3n−11,3,9,…, 3^{n-1}, every combination yields a total value:

 ∑i=0n−1di⋅3iwheredi∈{−1,0,1}\sum_{i=0}^{n-1}d_{i}\cdot3^{i} \;\text{where} \; d_{i}\in \{ -1,0,1 \}

 Each such signed sum gives a unique integer from

 −3n−12up to3n−12-\frac{3^{n}-1}{2} \; \text{up to} \;\frac{3^{n}-1}{2}

 That’s because the maximum value occurs when all digits are 1,1, and the minimum when all digits are −1-1. Both of those give **geometric series**of the form:

 ∑i=0n−13i=3n−12\sum_{i=0}^{n-1}3^{i}= \frac{3^{n}-1}{2}

 Thus, the range of possible integer weight coverage goes from −3n−12to3n−12-\frac{3^{n}-1}{2} \:to\: \frac{3^{n}-1}{2}, **inclusive**. That is

 3n−12−(−3n−12)+1=3n\frac{3^{n}-1}{2}-\left( -\frac{3^{n}-1}{2} \right)+1=3^{n}

 distinct integer values—exactly as many as there are combinations! On the other hand, to cover any integer weight from 1lb1\;\text{lb} up to some positive bound WlbW\;\text{lb}, we need

 3n−12≥W\frac{3^{n}-1}{2}\ge W

 Note that this is completely equivalent to putting all of the weights on one pan, giving you the maximum amount of measurable weight since it is the maximum amount one could “add” against the object (or the maximum one could “subtract” if one moved them all to the object’s side, with the opposite sign; in any case, it is the maximum absolute value).

 Setting W=100lbW=100 \;\text{lb} gives,

 3n−12≥100⟹3n≥201⟹n≥5\frac{3^{n}-1}{2}\ge 100 \Longrightarrow 3^{n}\ge 201 \Longrightarrow n\ge 5

 Hence, n=5n=5is both necessary and sufficient since

 30=1,31=3,32=9,33=27,34=81,35=2433^{0}=1,\:\:3^{1}=3,\:\:3^{2}=9,\:\: 3^{3}=27,\:\: 3^{4}=81,\:\: 3^{5}=243

 Therefore, only 55 precalibrated weights are necessary and sufficient to weigh any integer weight between 11 and 100100. Use weights of 1,3,9,27,811, 3, 9, 27, 81  pounds, the powers of three that can represent every integer from 11 through 100100 as a balanced ternary number with no more than five digits. We can generalize this result by applying the log and the ceiling functions to calculate the exponent directly. Then, the minimum number of weights needed to weigh every integer from 1 through WW is

 nmin=⌈log3⁡(2W+1)⌉n_{\text{min}}=\left\lceil \log_{3}(2W+1) \right\rceil

#### How it works in practice

 Fig. 2 How to weigh a 100-pound object

 Suppose you want to weigh a 100lb100 \;\text{lb} object. Place the object on the right pan. Then convert the decimal number 100100 into a ternary number. To convert 100 into balanced ternary, repeatedly divide by 33, using the remainders as digits. Whenever a remainder is 2, replace it with -1 and increase the quotient by 1. Continuing this process gives 1,0,−1,1,11,0,-1,1,1, read in reverse order. Thus 100=1,1,−1,0,1100=1,1,-1,0,1 . Observe what this means: you need to place the 81lb81 \;\text{lb}, 27lb27\;\text{lb}, and 1lb1\;\text{lb} weights on the left pan (against the object), and you need to place the 9lb9\;\text{lb} weight on the right pan (with the object). Then the pans balance, confirming the object weighs 100lb100\;\text{lb}. This scheme works for any of the given objects you wish to weigh (see the image above).

#### Further Exploration: What if we change the rules?

In the original puzzle, you could place an object on either pan. But suppose we add a new constraint: weights can only be placed on the pan opposite the object.

**What would be the fewest number of precalibrated weights necessary to bring into balance any of the 100 objects?**

#### Hint

Reveal Hint What number system, that underlies the logic of modern electronic computers, is ideal for two-state values?

#### Solution

Reveal solution This time you can either use a weight or not. Therefore, the two “states” are: “**used**” and “**unused**“. Assume there are nn such weights, where n∈ℤ+n\in \mathbb{Z^{+}}. Since each weight can be in two possible states, by the multiplication principle, there are 2n2^{n} possible combinations of weight placements. Hence, we can reframe this problem as one of **binary representation**by assigning values from the set {0,1}\{ 0,1 \} to each weight state:

1. 00 if the weight is not used
2. 11 if the weight is used

 Moreover, the weight of any object to be weighed may be written as a unique sum of powers of 22. Thus, for weights 1,2,4,...,2n−11,2,4,…, 2^{n-1}, every combination yields a total value:

 ∑i=0n−1di⋅2iwheredi∈{0,1}\sum_{i=0}^{n-1}d_{i}\cdot2^{i} \;\text{where} \; d_{i}\in \{0,1\}

 Each such sum gives a unique integer from

 0up to2n−10\: \text{up to} \;2^{n}-1

 That’s because the maximum value occurs when all digits are 1,1, and the minimum when all digits are 0. Both of which give **geometric series**of the form:

 ∑i=0n−12i=2n−1\sum_{i=0}^{n-1}2^{i}=2^{n}-1

 Thus, the range of possible integer weight coverage goes from 0to2n−10 \:\text{to}\: 2^{n}-1, **inclusive**. That is

 (2n−1)+1=2n(2^{n}-1)+1=2^{n}

 distinct integer values—exactly as many as there are combinations! On the other hand, to cover any integer weight from 1lb1\;\text{lb} up to some upper bound WlbW\;\text{lb}, we need

 2n−1≥W2^{n}-1\ge W

 Note that this is completely equivalent to putting all of the weights on one pan, giving you the maximum amount of measurable weight since it is the maximum amount one could add. Solving for nn gives

 nmin=⌈log2⁡(W+1)⌉n_{\text{min}}=\left\lceil \log_{2}(W+1) \right\rceil

 Setting W=100lbW=100 \;\text{lb} gives,

 nmin=⌈log2⁡(100+1)⌉=⌈log2⁡(101)⌉≈⌈6.65⌉=7n_{\text{min}}=\left\lceil \log_{2}(100+1) \right\rceil=\left\lceil \log_{2}(101) \right\rceil\approx \left\lceil 6.65\right\rceil=7

 Therefore, only 77 precalibrated weights are necessary and sufficient to weigh any integer weight between 11 and 100100. Use weights of 1,2,4,8,16,32,641, 2, 4, 8, 16, 32, 64  pounds, the powers of three that can represent every integer from 11 through 100100 as a balanced ternary number with no more than **seven digits**; a few more than using ternary representation, so we might say that the first method is more efficient.

 Now it is your turn to experiment! Use the calculator below to convert different whole numbers into binary. Enter a number or click the binary digits to change them, and watch how the corresponding powers of two add up to the result. Remember that every digit 11 represents a weight placed on the pan opposite the object, while every 00 represents an unused weight.

 Can you find the combination of weights needed to balance any object weighing between 11 and 100100 pounds?

 **Binary Place-Value Chart**Explore the powers of two

 Decimal number (0–255)  Place valuePower of 2BitContribution

Click any binary digit to switch it between 0 and 1.

#### A Final Challenge: The Unknown Object

Now, suppose we go back to the original puzzle, so we are allowed to place the objects on either pan again, and you wish to **determine the weight of a single object** known to have a weight in the given range (i.e., from 11 pound to 100100 pounds at one-pound intervals), what is the **minimum number** **of weights**required? **Which weights would be used?**[2](#df680236-403a-4e3d-bcaf-039cef6dd2e2)

#### Hint

Reveal Hint Note that you don’t have to bring into balance **all the objects**; all that is required is to determine the unknown weight.

#### Solution

Reveal solution The minimum number of weights needed to weigh 100 objects with weight w∈{1,2,3,...,100}w \in \{1,2,3,…,100 \}, assuming that the weights may be placed on either pan, is still **five**: 2,6,18,54,1622, 6, 18, 54, 162 (they represent doublings of powers of successive powers of 3). Each weight can be placed on either pan or left unused. Consequently, every signed difference has the form

 2a+6b+18c+54d+162e=2(a+3b+9c+27d+81e)wherea,b,c,d,e∈{−1,0,1}2a+6b+18c+54d+162e=2(a+3b+9c+27d+81e) \:\:\: \text{where} \: \: a,b,c,d,e \in \{-1,0,1\}

 By the result of the first problem, the expression a+3b+9c+27d+81ea+3b+9c+27d+81e can represent every integer from 11 to 121121. Therefore, these weights can produce every even number from 2 to 242. In particular, we can**achieve exact balance for every even number of pounds from**11**through**100100. What about objects weighing an odd number of pounds? Since the weights available are all even, exact equilibrium is impossible. However, we can **determine their weights by comparing them with the adjacent even numbers**.

 For example, suppose an object weighs 6767 pounds. We can establish that it weighs less than 6868 pounds and more than 6666 pounds:

- To compare against 6868 pounds, place the object and the 66-pound weight on one pan, and the 22-, 1818-, and 5454-pound weights on the other. If the object is lighter, then it must weigh less than 6868 pounds.
- To compare against 6666 pounds, place the object and the 66-pound weight on one pan, and the 1818– and 5454-pound weights on the other. If the object is heavier, then it must weigh more than 6666 pounds.

 This can be generalized as follows: Suppose we have nn calibrated weights. Each can be placed on the left pan, the right pan, or left unused, giving 3n3^npossible configurations. Let mm denote the number of distinct**positive weight differences**that these configurations can produce.

 Because exchanging the pans reverses the sign of every difference, the configurations come in pairs, except for those producing zero. Thus,

 m≤3n−12m\le\frac{3^{n}-1}{2}

 Now arrange the mm distinct **comparison values**in increasing order:

 t1<t2<...<tmt_{1}\lt t_{2}\lt …\lt t_{m}

 These comparisons can distinguish at most 2m+12m+1 different possibilities for the object’s weight: **equality with one of the mm values**, or **lying in one of the intervals between them** (including the two outer intervals). Consequently,

 W≤2m+1≤3nwhereWis some positive weight upper boundW\le2m+1 \le 3^{n} \: \text{where}\:W \: \text{is some positive weight upper bound}

 It follows from this that

 n≥⌈log⁡W⌉n\ge \left\lceil \log W \right\rceil

 Let us know pick our weights in such way as to show that this lower bound can be achieved. As before, let us choose the weights

 2,6,18,...,2⋅3n−12, 6, 18, …, 2\cdot3^{n-1}

 Therefore, every combination yields a total value:

 ∑i=0n−12(di⋅3i)wheredi∈{−1,0,1}\sum_{i=0}^{n-1}2(d_{i}\cdot3^{i}) \;\text{where} \; d_{i}\in \{ -1,0,1 \}

 Each such signed sum gives a unique even integer from

 −(3n−1)up to3n−1-\left( 3^{n}-1 \right)\; \text{up to}\:3^{n}-1

 Indeed, dividing the weights by two gives the ordinary powers of three, whose signed combinations represent every integer in the balanced ternary system. As a result, we can use the available weights to compare an unknown object against any even amount in the sequence

 2,4,8,...,(3n−1)2, 4, 8, …, \left( 3^{n}-1 \right)

 These comparison values allow us to distinguish every integer from 11 through 3n3^{n}:

- An object weighing an even number can be identified by achieving exact equilibrium.
- An object weighing an odd number lies strictly between two consecutive even comparison values.
- At the endpoints, the known range supplies the missing inequality.

 Thus, nn weights suffice to identify any integral weight up to 3n3^n. Since we have already established that fewer than ⌈log3⁡W⌉\lceil\log_3 W\rceil weights cannot suffice, our construction is optimal. Hence, the minimum number of weights needed todetermine the weight of a single object known to have a weight in the range from 1 through WW is

 nmin=⌈log3⁡W⌉n_{\text{min}}=\left\lceil \log_{3}W \right\rceil

 **Beyond the 100 range**

 The answer was identical to the first case in which we were asked to balance each and every object, but we discovered that the weights used were different and the general formula was also different. What then would be **the first time** the minimum number of weights differs, assuming we have more than one hundred objects?

### References & Further Reading

1. Adapted from Hoeflin, R. K. (1985, April). *Problem 38 in The Mega Test*. Omni, 7(4), p. 132. [↩︎](#4d282c3a-c512-4037-a3f6-c5b2bf91f524-link)
2. This problem is a slight variation of a balance-scale problem posed by Martin Gardner in *Martin Gardner’s Sixth Book of Mathematical Diversions from Scientific American* (Chicago: University of Chicago Press, 1983; originally published in 1971), 107. Gardner’s original problem asks for the minimum number of weights needed to determine the weight of an object known to weigh an integral number of pounds between 1 and 27, assuming that the weights may be placed on either pan. The present version retains the original setup but extends the range to 1–100 pounds. [↩︎](#df680236-403a-4e3d-bcaf-039cef6dd2e2-link)

### Leave a Comment [Cancel Reply](/numbers-balance/#respond)
