Bunuel
Balls of equal size are arranged in rows to form an equilateral triangle. the top most row consists of one ball, the 2nd row of two balls and so on. If 669 balls are added, then all the balls can be arranged in the shape of square and each of the sides of the square contain 8 balls less than the each side of the triangle did. How many balls made up the triangle?
A. 1210
B. 1540
C. 1560
D. 2209
E. 2878
Are You Up For the Challenge: 700 Level QuestionsLet there be n rows..
1st row has 1 ball, 2nd has 2 balls, 3rd has 3 balls, so nth row will have n rows. Thus the side of equilateral triangle so formed is n..
Number of balls in the equilateral triangle =\(1+2+3+...(n-1)+n=\frac{n(n+1)}{2}\) If 669 balls are added, then all the balls can be arranged in the shape of square and each of the sides of the square contain 8 balls less than the each side of the triangle did.
So, each side of the square is n-8 and the number of balls in this square = \((n-8)^2\).
This should be equal to \(\frac{n(n+1)}{2}+669\) \(\frac{n(n+1)}{2}+669=(n-8)^2.........n^2+n+1338=2n^2-32n+128.....n^2-33n-1210=0.....(n-55)(n+22)=0\)
So, n can be 55 or -22, but n is positive so 55..
Number of balls in the equilateral triangle =\(1+2+3+...(n-1)+n=\frac{n(n+1)}{2}=\frac{55*56}{2}=55*28=1540\)B
I do not know where the n(n+1)/2 comes from. From my point of view, it should be n*n*\sqrt{3}\frac{2[}{fraction]. If I understood correctly, n should be the base and (n [fraction] 2 } ) \sqrt{ 3 } the height of the triangle. The rest of the problem is pretty clear