Ho Soo Thong Ho Shuyuan
This write-up illustrates the bar modelling approach to a variant of a recently highlighted 2017 PSLE question. The problem solving strategy involves the use of Euclidean Division Algorithm to depict the two “remainder” situations.
A Ribbon Problem
Jane, a sales supervisor, has to prepare 150 ribbons for gift wrapping. Each ribbon is of length 160 cm. The ribbons are cut out from tapes of length 20 m each.
How many tapes are needed to prepare all 150 ribbons?
For the number of ribbon that can be made from each tape of length 20 m = 2000 cm,we construct a bar model with Euclidean Division Algorithm.
12 ribbons can be made per tape and the remaining 80 cm of tape has to be discarded.
For 150 ribbons, we again apply the Euclidean Division Algorithm and the bar model shows that one more tape is needed for the remaining 6 ribbons.
Therefore, Jane needs 12 + 1 = 13 tapes.
An earlier PSLE question (15/02/2014 ) also involves a non-discarded “leftover“ situation. This was solved with bar model and Euclidean Division Algorithm. This also highlight the use for a pictorial view of the problem to give students a clearer understanding of the situation described in the problem.
红丝带问题 – 杆模型方法
第一阶段 : 每卷丝带能剪成几条丝带.
我们先用一个杆模型展示如何应用欧几里德分割算法把20 m = 2000 cm 长的丝带裁剪成12条160cm 的红条丝带 ，并丢弃剩余80厘米的丝带。
第二阶段 : 需要多少卷丝带才能剪成185条丝带.
因此，小呢需要15 + 1 = 16卷丝带。
練習題 : PSLE（15/02/2014)