Smallest Set of Weights for One-Pan Balance/Historical Note
Jump to navigation
Jump to search
Historical Note on Smallest Set of Weights for One-Pan Balance
The question of how many weights are needed to weigh any given integer weight up to a given amount was considered by Leonardo Fibonacci.
The one-pan balance version of this problem was solved by Niccolò Fontana Tartaglia.
Sources
- 1986: David Wells: Curious and Interesting Numbers ... (previous) ... (next): $31$
- 1992: David Wells: Curious and Interesting Puzzles ... (previous) ... (next): Bachet: $108$
- 1997: David Wells: Curious and Interesting Numbers (2nd ed.) ... (previous) ... (next): $31$