1. Problem Solving

Any help you give me I will appreciate greatly. Thanks!

"
A landscape architect needs to design a path for the Museum of Modern Art. The path is to be made of black and red tiles in the following pattern: 1 black, 1 red, 2 black, 2 red, 3 black, 3 red, 4 black, 4 red,.... The pattern of altnerating colors is to continue so that each block of a single color has one more tile than the preceding block of the same color. The museum curator estimated that 5000 tiles will be needed for the project. She ordered 2500 black tiles and 2500 red ones. If the landscape architect wants to use all of these tiles and have the path end with a block of black tiles followed by the same number of red tiles, what is the smallest number of additional black and red tiles that should be ordered?
"

Problems like this boggle my mind. Thanks again for any help.

2. Hello, nrmegin!

It helps if you know this formula . . .

The sum of integers from 1 to $\displaystyle n$ is given by:

. . $\displaystyle 1 + 2 + 3 + \cdots + n \;=\;\frac{n(n+1)}{2}$

A landscape architect needs to design a path for the Museum of Modern Art.
The path is to be made of black and red tiles in the following pattern:
1 black, 1 red, 2 black, 2 red, 3 black, 3 red, 4 black, 4 red, ...

The pattern of alternating colors is to continue so that each block of a single color
has one more tile than the preceding block of the same color.

The museum curator estimated that 5000 tiles will be needed for the project.
She ordered 2500 black tiles and 2500 red ones.
If the landscape architect wants to use all of these tiles and have the path end
with a block of black tiles followed by the same number of red tiles,
what is the smallest number of additional black and red tiles that should be ordered?

The total number of tiles is: . $\displaystyle T \;=\; 1 + 1 + 2 + 2 + 3 + 3 + \cdots + n + n$

. . $\displaystyle T \;=\;2(1 + 2 + 3 + ... + n) \;=\;2\cdot\frac{n(n+1)}{2} \;=\;n(n+1)$

If $\displaystyle T = 5000$, we have: .$\displaystyle n(n+1) \:=\:5000 \quad\Rightarrow\quad n^2 + n - 5000 \:=\:0$

Quadratic Formula: .$\displaystyle n \;=\;\frac{-1 \pm\sqrt{20001}}{2}$

. . The positive root is: .$\displaystyle n \:\approx\:70.212$

If $\displaystyle n = 71$, then: .$\displaystyle T \:=\:71\cdot72 \:=\:5112$

. . Therefore, a minimum of 112 more tiles are needed.

3. Thanks a lot man, I really appreciate it. I wouldn't have that formula because we're doing a Problem Solving unit, that gives us no formulas. Once again, thanks a lot.