A city planner is designing a rectangular park. Two pathways are to be laid: one of length 360 m and another of length 252 m. Identical square tiles are to be used to pave both pathways with no tile cut and tiles as large as possible.
A city planner is designing a rectangular park. Two pathways are to be laid across the park: one of length 360 m and another of length 252 m. The planner wants to pave both pathways using identical square tiles, with no tile cut, and each tile as large as possible.
(i) Find the largest possible side length of each square tile. (1 mark)
(ii) Find the total number of tiles required to pave both pathways. (1 mark)
(iii) The planner later discovers that a third pathway of length 'n' metres is to be added. She is told that the LCM of all three pathway lengths (360, 252, and n) is 2520. Given that n is a two-digit number and HCF(360, n) = 36, find the value of n. (2 marks)
Show answerHide answer
Prime factorisation:
360 = 2³ × 3² × 5
252 = 2² × 3² × 7
⟹ HCF(360, 252) = 2² × 3² = 4 × 9 = 36
∴ The largest possible side length of each square tile is 36 m.
(ii) Number of tiles for pathway 1 = 360 ÷ 36 = 10
Number of tiles for pathway 2 = 252 ÷ 36 = 7
∴ Total number of tiles = 10 + 7 = 17
(iii) Given: LCM(360, 252, n) = 2520, HCF(360, n) = 36, and n is a two-digit number.
Prime factorisation of 360 = 2³ × 3² × 5
Prime factorisation of 2520 = 2³ × 3² × 5 × 7
For HCF(360, n) = 36 = 2² × 3²:
⟹ n must contain 2² and 3² as factors (to give HCF = 36 with 360), but n must NOT contain 2³ (otherwise HCF would include 2³, not 2²).
⟹ n is of the form 2² × 3² × k = 36k, where k does not contain factors of 2 or 5 beyond what is already accounted for.
For LCM(360, 252, n) = 2520 = 2³ × 3² × 5 × 7:
⟹ n must NOT introduce any new prime factor beyond {2, 3, 5, 7}, and the LCM condition must hold.
Since 2520 = 2³ × 3² × 5 × 7, the factor 7 must come from n (as 360 = 2³ × 3² × 5 does not contain 7, and 252 = 2² × 3² × 7 already provides it — but we verify via n).
Let n = 36k = 2² × 3² × k.
For LCM(360, n) to divide 2520: n must divide 2520.
⟹ 36k | 2520 ⟹ k | 70.
Also HCF(360, n) = 36 requires k shares no factor of 2 or 3 with (360/36) = 10 = 2 × 5, meaning k must be odd (not divisible by 2).
Divisors of 70 that are odd: 1, 5, 7, 35.
⟹ Possible values of n = 36×1=36, 36×5=180, 36×7=252, 36×35=1260.
Since n is a two-digit number:
⟹ n = 36 (k=1) is the only two-digit candidate.
Verification: HCF(360, 36) = 36 ✓; LCM(360, 252, 36) = LCM(360, 252) = LCM(2³×3²×5, 2²×3²×7) = 2³×3²×5×7 = 2520 ✓.
∴ n = 36.