Reasoning · Grade 2-1 Measuring Length with Units

Problem

Total length of a bent string

One identical cuboid box is wrapped with string in four different ways (㉠, ㉡, ㉢, ㉣). Every wrap is made of complete loops that go right around the box, and the knots are ignored. Rank the four boxes from the most string used to the least.
A B C D
Your answer
How to solve
Strategy Draw a Diagram — Picture each string path as one or more loops around the box. Each loop is a rectangle that goes over the top, down a side, under the bottom, and up the other side, so it uses two base edges plus two heights. I break every box into its loops (subproblems), then organize the counts of length-edges, width-edges, and heights in a table so I can compare the four totals directly — no measuring needed.
1STEP 1

See what one loop costs

One loop traces a rectangle, so it uses two base edges and two heights.

loop = 2 × (base edge) + 2 × (height)
2STEP 2

Count the parts of each box

Counting: ㉠ is 2L+2W+4H, ㉡ is 4W+4H, ㉢ is 4L+4H, ㉣ is 2W+2H.

㉠:2L+2W+4H, ㉡:4W+4H, ㉢:4L+4H, ㉣:2W+2H
3STEP 3

Compare ㉢, ㉡, and ㉠ using length > width

With equal counts the box using more long edges wins: ㉢, then ㉠, then ㉡.

㉢ > ㉠ > ㉡
4STEP 4

Place ㉣ last

㉣ has only one loop and just two heights, so it is the shortest.

㉣ = 2W + 2H (the smallest)
5STEP 5

Write the order from longest to shortest

Putting it together, the order is ㉢, ㉠, ㉡, ㉣.

㉢ > ㉠ > ㉡ > ㉣
Answer
㉢, ㉠, ㉡, ㉣
The unit is length, and the order is a ranking of four wraps — exactly what the question asks. The most-wrapped, longest-direction box (㉢) is first and the single-loop box (㉣) is last, which matches common sense: more loops and loops around the longer side use more string.
Takeaway

You don't need any numbers — just count the loops and remember that going around the longer side uses more string!

  • See what one loop costs
  • Count the parts of each box
  • Compare ㉢, ㉡, and ㉠ using length > width
  • Place ㉣ last
  • Write the order from longest to shortest