Splitting a Measured Amount: Possible Numbers of Parts
Splitting a Measured Amount: Possible Numbers of Parts
From a measured total and a measured part size, find the least and greatest possible number of parts.
- 74 bytes
- COMP mode
Worked examples
Example 1
A podcast episode lasts 45 minutes, correct to the nearest minute. The whole episode is divided, with nothing left over, into n segments, each timed as 90 seconds, correct to the nearest 10 seconds. The true lengths of the segments may differ.
(a) Find the least possible value of n.
(b) Find the greatest possible value of n.
Answer
Standard solution (without a calculator)
- Same unit and intervals: in seconds, 2670 ≤ T < 2730 for the episode (44.5 to 45.5 minutes) and 85 ≤ s < 95 for each segment.
- Use up the whole episode: n segments last from 85n up to (not including) 95n. This must meet [2670, 2730): 2670 < 95n and 85n < 2730 — both inequalities stay strict.
- Whole numbers: 2670/95 < n < 2730/85, about 28.11 < n < 32.12, so n = 29 to 32.
- Check the neighbours: 28 segments are each under 95 s, under 2660 s in all — not enough for at least 2670 s; 33 segments need at least 2805 s. 2670 s in 29 equal segments (about 92.07 s each), and 32 segments of 85 s (2720 s), both work.
Example 2
A bag of craft material weighs 1 kg, correct to the nearest 100 g. All of it is packed, with no waste, into n packets, each weighing 20 g, correct to the nearest 2 g. All the material is used; the packets need not weigh the same.
(a) Find the least possible value of n.
(b) Find the greatest possible value of n.
Answer
Standard solution (without a calculator)
- Convert the rounding unit: the total is in kg, so the nearest 100 g is the nearest 0.1 kg, and half of it is 0.05 kg. So 0.95 ≤ total (kg) < 1.05, that is 950 ≤ T < 1050 (g).
- The packets: 19 ≤ each packet < 21 (g), so n packets weigh from 19n up to (not including) 21n, which must meet [950, 1050): 950 < 21n and 19n < 1050.
- Bounds: 950/21 < n < 1050/19, about 45.24 < n < 55.26, so n = 46 to 55.
- Check: 45 packets weigh under 945 g, too little; 56 packets need at least 1064 g, too much. 950 g in 46 equal packets, and 55 packets of 19 g (1045 g), both work.
Example 3
A laboratory has a bottle of solution measured as 2 L, correct to the nearest 0.2 L. All of it is poured, with no waste, into n small bottles, each measured as 40 mL, correct to the nearest 20 mL. Which of the following gives the least and the greatest possible values of n?
A. least 38, greatest 70
B. least 38, greatest 69
C. least 39, greatest 70
D. least 39, greatest 69
Answer
Standard solution (without a calculator)
- Two intervals: 1.9 ≤ total (L) < 2.1, that is 1900 ≤ T < 2100 (mL); 30 ≤ each bottle < 50 (mL).
- Strict inequalities: [30n, 50n) must meet [1900, 2100): 1900 < 50n and 30n < 2100, so 38 < n < 70. Both ends are whole numbers here, but neither is included.
- Why not 38 or 70: 38 bottles hold under 50 mL each, under 1900 mL in all; 70 bottles hold at least 30 mL each, at least 2100 mL in all. Neither fits.
- Check the answer: 1900 mL in 39 equal bottles (about 48.718 mL each) and 69 bottles of 30 mL (2070 mL) both work, so the least is 39 and the greatest 69: D.
When to use it
Approximation and bounds problems sometimes share a measured whole into parts that are themselves measured — for example, a recording timed to the nearest minute split into segments timed to the nearest 10 seconds. Every true value lies in a half-open interval, so the number of parts n is bounded by strict inequalities. 012 takes the five numbers as written in the question and shows the least n and then the greatest n, without halving any unit by hand.
What it is for
- The whole is used up with no waste, and each part lies in its own measured range
- The least and the greatest possible number of parts
- The parts need not be equal; equal sharing is only one way
What you enter
- A: the measured total; B: its accuracy as a whole unit (nearest 1 m → 1)
- C: the measured size of one part; D: its accuracy as a whole unit
- X: how many part units make one total unit (m to cm 100, kg to g 1000, same unit 1)
What it shows
- The least possible number of parts (press EXE)
- The greatest possible number of parts — the last result
- If the first is larger than the second, no whole number of parts is possible
Check before use
- A and B use the same unit, and C and D use the same unit. Enter B and D as the whole rounding unit, not half of it: to the nearest 100 g with A in kg means B = 0.1.
- B, D and X must be positive, the total’s lower bound must not be negative and each part’s lower bound must be positive: 2A ≥ B and 2C > D. Do not use an accuracy of 0 for an exact value.
- If the first result is larger than the second (for example 2 and then 1), no positive whole number of parts is possible; it does not mean zero parts.
- Not for leftover material, cutting loss, values truncated instead of rounded, parts of different sizes or a guaranteed minimum output; set up the intervals again for those.
- Enter all five values every time. Read up to the second result so that the program finishes and returns to Norm 1 by itself.
- The calculator has limited precision: with very large inputs, or when a quotient is within the last few digits of a whole number, check with the strict inequalities; the program is not an arbitrary-precision proof.
- Run in COMP; the angle unit does not matter. The example uses P1 — clearing P1 in the set-up deletes what is there, so use an empty area if you need to keep it. A, B, C, D, X, Y and Ans are used.
Checking access…