Question 20
The bar graph shows the initial numbers of pencils Grace, Amy and Dan had. All horizontal lines are equally spaced.
Day 1: Grace gives half her pencils to Amy. Day 2: Amy gives half her pencils to Dan. Day 3: Dan gives half his pencils to Grace. Repeat these transfers on days 4, 5 and 6. On day 7, Grace cannot give an integer number of pencils to Amy, so the process stops. What is the lowest possible number of pencils Dan has on day 7?
Each completed transfer is of whole pencils. Day 7 stops before any transfer. Read the bottom horizontal line as zero.
Answer entry: enter the whole number only, without units. The paper uses four shaded digits with leading zeros; ordinary integer entry is accepted here.
Day 1: Grace gives half her pencils to Amy. Day 2: Amy gives half her pencils to Dan. Day 3: Dan gives half his pencils to Grace. Repeat these transfers on days 4, 5 and 6. On day 7, Grace cannot give an integer number of pencils to Amy, so the process stops. What is the lowest possible number of pencils Dan has on day 7?
Each completed transfer is of whole pencils. Day 7 stops before any transfer. Read the bottom horizontal line as zero.
Answer entry: enter the whole number only, without units. The paper uses four shaded digits with leading zeros; ordinary integer entry is accepted here.