Bunuel

A large equilateral triangle is constructed by using toothpicks to create rows of small equilateral triangles. For example, in the figure, we have 3 rows of small congruent equilateral triangles, with 5 small triangles in the base row. How many toothpicks would be needed to construct a large equilateral triangle if the base row of the triangle consists of 2003 small equilateral triangles?
(A) 1,004,004
(B) 1,005,006
(C) 1,507,509
(D) 3,015,018
(E) 6,021,018
Attachment:
The attachment 16ca1f0305d713b2b9e5a0c53658d11829856ec7.png is no longer available
As per counting of triangles shown in figure the triangle in first row = 1
triangles in second row = 3
triangles in third row = 5
Taringles in nth row = 2003
i.e. 1+2*(n-1) = 2003
i.e. n = 1002
Considering only triangles with peak vertex up
For only one equilateral triangle at the top the Toothpicks needed = 3*1
For two rows of Equilateral triangle, Toothpicks needed = 3*(1+2) where 1+2 represents triangles with peak vertex upside
For Three rows of Equilateral triangle, Toothpicks needed = 3*(1+2+3) where 1+2+3 represents triangles with peak vertex upside
i.e. triangles needed for 1002 rows = (1+2+3+----+1002)*3 = [(1/2)*1002*1003]*3 = 1,507,509
Answer: Option C
Attachments
File comment: www.GMATinsight.com

Screenshot 2019-03-20 at 2.41.32 PM.png [ 980.72 KiB | Viewed 3814 times ]