Maya follows a walking programme. The distance she walks each day is shown in the table.
| Day, \( n\) | \(1\) | \(2\) | \(3\) | \(4\) | \(5\) | \(n\) |
|---|---|---|---|---|---|---|
| Distance walked (km) | \(2.5\) | \(3.0\) | \(3.5\) | \(4.0\) |
Complete the table.
[2]Leo follows a different exercise programme. The number of flights of stairs he climbs each day is shown below.
| Day, \( n\) | \(1\) | \(2\) | \(3\) | \(4\) | \(5\) |
|---|---|---|---|---|---|
| Number of flights | \(3\) | \(6\) | \(12\) | \(24\) | \(48\) |
Find, in terms of \(n\), the number of flights Leo climbs on Day \(n\).
[2]Find the least value of \(n\) such that Leo climbs at least \(100\) flights on Day \(n\).
[2]Sign in to view the step-by-step solution
Need help? Join our JC Math tuition classes.
Learn more