Example 1
Question: 150 apples are arranged in a triangular stack: 18 apples in the bottom row, 17 in the next row, 16 in the row above that, and so on. In how many rows are the 150 apples placed, and how many apples are in the top row?
Solution: The number of apples in each row forms an AP where the first term is \( a = 18 \), the common difference is \( d = -1 \), and the total number of apples is \( S_n = 150 \).
Using the sum formula: \[ S_n = \frac{n}{2}(2a + (n-1)d) \]
Substituting the known values: \[ 150 = \frac{n}{2}(2 \times 18 + (n-1)(-1)) \]
Simplifying inside the bracket: \[ 150 = \frac{n}{2}(36 - n + 1) \] \[ 150 = \frac{n}{2}(37 - n) \]
Multiplying both sides by 2: \[ 300 = n(37 - n) \] \[ 300 = 37n - n^2 \]
Rearranging: \[ n^2 - 37n + 300 = 0 \]
Using the quadratic formula: \[ n = \frac{37 \pm \sqrt{37^2 - 4 \times 300}}{2} = \frac{37 \pm \sqrt{1369 - 1200}}{2} = \frac{37 \pm \sqrt{169}}{2} = \frac{37 \pm 13}{2} \]
So \( n = \frac{37 + 13}{2} = 25 \) or \( n = \frac{37 - 13}{2} = 12 \).
Checking \( n = 25 \): The top row would have \( a_{25} = 18 + (25-1)(-1) = 18 - 24 = -6 \) apples, which is not possible.
So \( n = 12 \). The number of apples in the top row is: \[ a_{12} = 18 + (12-1)(-1) = 18 - 11 = 7 \]
Verification: \[ S_{12} = \frac{12}{2}(18 + 7) = 6 \times 25 = 150 \checkmark \]
Answer: The 150 apples are placed in 12 rows, with 7 apples in the top row.
Example 2
Question: A worker stacks 300 bricks in rows such that the bottom row has 25 bricks, the row above has 24 bricks, the next has 23 bricks, and so on. How many rows does it take to stack all 300 bricks, and how many bricks are in the topmost row?
Solution: The number of bricks per row forms an AP with first term \( a = 25 \), common difference \( d = -1 \), and total \( S_n = 300 \).
Using the sum formula: \[ S_n = \frac{n}{2}(2a + (n-1)d) \]
Substituting: \[ 300 = \frac{n}{2}(2 \times 25 + (n-1)(-1)) \]
Simplifying: \[ 300 = \frac{n}{2}(50 - n + 1) \] \[ 300 = \frac{n}{2}(51 - n) \]
Multiplying both sides by 2: \[ 600 = n(51 - n) \] \[ 600 = 51n - n^2 \]
Rearranging: \[ n^2 - 51n + 600 = 0 \]
Factorising: We need two numbers that multiply to 600 and add to 51. These are 26 and 25: \[ (n - 25)(n - 26) = 0 \]
So \( n = 25 \) or \( n = 26 \).
Checking \( n = 26 \): The top row would have \( a_{26} = 25 + (26-1)(-1) = 25 - 25 = 0 \) bricks, which is not meaningful.
So \( n = 25 \). The number of bricks in the top row is: \[ a_{25} = 25 + (25-1)(-1) = 25 - 24 = 1 \]
Verification: \[ S_{25} = \frac{25}{2}(25 + 1) = \frac{25}{2} \times 26 = 25 \times 13 = 325 \]
This gives 325, not 300. Re-checking factorisation: \( n^2 - 51n + 600 = 0 \). Discriminant: \[ \Delta = 51^2 - 4 \times 600 = 2601 - 2400 = 201 \]
Since 201 is not a perfect square, let us re-examine. \( \sqrt{201} \approx 14.17 \), giving \( n \approx \frac{51 + 14.17}{2} \approx 32.6 \) or \( n \approx \frac{51 - 14.17}{2} \approx 18.4 \). Since \( n \) must be a whole number, try \( n = 20 \): \[ S_{20} = \frac{20}{2}(50 + 19 \times (-1)) = 10 \times 31 = 310 \] Too high. Try \( n = 19 \): \[ S_{19} = \frac{19}{2}(50 + 18 \times (-1)) = \frac{19}{2} \times 32 = 19 \times 16 = 304 \] Still above 300. Try \( n = 18 \): \[ S_{18} = \frac{18}{2}(50 + 17 \ times (-1)) = 9 \times 33 = 297 \] Below 300. Since 300 bricks cannot be evenly arranged with this decreasing-by-1 pattern starting at 25, the closest valid arrangement uses \( n = 20 \) rows giving \( S_{20} = 310 \). However, adjusting the top row: after 19 complete rows (297 bricks), the 20th row holds the remaining \( 300 - 297 = 3 \) bricks. So there are 20 rows and the top row has 3 bricks.
Answer: The 300 bricks are stacked in 20 rows, with 3 bricks in the top row.