Question 838176
{{{drawing(150,150,-75,75,-40,110,
triangle(-50,0,50,0,0,86.6),
locate(0,30,1)
)}}} --> {{{drawing(250,250,-125,125,-125,125,
triangle(-50,0,50,0,0,86.6),locate(0,30,1),
red(triangle(-100,-86.6,0,-86.6,-50,0)),
red(triangle(100,-86.6,0,-86.6,50,0)),
locate(-50,-50,red(1)),locate(50,-50,red(2))
)}}} --> {{{drawing(330,330,-165,165,-210,120,
triangle(-50,0,50,0,0,86.6),locate(0,30,1),
red(triangle(-100,-86.6,0,-86.6,-50,0)),
red(triangle(100,-86.6,0,-86.6,50,0)),
locate(-50,-50,red(1)),locate(50,-50,red(2)),
green(triangle(-150,-173,-50,-173,-100,-86.6)),green(triangle(-50,-173,50,-173,0,-86.6)),
green(triangle(50,-173,150,-173,100,-86.6)),locate(-100,-143,green(1)),
locate(0,-143,green(2)),locate(100,-143,green(3))
)}}}
All you have to do to draw each row of triangles is draw the numbered triangles.
The ones without numbers get formed by the sides of the numbered triangles.
You draw 1 triangle for row/diagram number 1.
You add 2 triangles for row 2 in diagram number 2, for a total of 3 triangles.
You add 3 triangles for row 3 in diagram number 3, for a total of 6 triangles.
Each triangle drawn takes 3 line segments.
The first diagram used {{{3*1=3))) segments.
The second diagram used {{{3*3=9}}} segments, and the third used {{{3*6=18}}} .
The pattern above continues.
We could calculate formulas for the total number of triangles in the nth diagram, the number of segments in the nth diagram, and the total number of segments in the first diagram, but we do not need to.
The problem GIVES us the formula (sort of).
If it is true,
in the first {{{1}}} diagram, there are
{{{a*1^3+b*1^2+1=a+b+1}}} segments.
We know that number is {{{3}}} , so
{{{a+b+1=3}}} --> {{{a+b=3-1}}} --> {{{a+b=2}}} .
In the first {{{2}}} diagrams, there should be a total of
{{{a*2^3+b*2^2+2=8a+4b+2}}} segments.
We know that there are {{{3+9=12}}} segments, so
{{{8a+4b+2=12}}} --> {{{8a+4b=12-2}}} --> {{{8a+4b=10}}} --> {{{4a+2b=5}}}
Now we have a system of two linear equations in {{{a}}} and {{{b}}} that is really easy to solve:
{{{system(a+b=2,4a+2b=5)}}} --> {{{highlight(system(a=1/2,b=3/2))}}} .
So the total number of segments in the first {{{n}}} diagrams is
{{{n^3/2+3n^2/2+n}}}
Just for curiosity, let's se if it works for {{{n=3}}} .
It would be
{{{3^3/2+3*3^2/2+3=27/2+27/2+3=27+3=30}}}
Since we had {{{3}}} , {{{9}}} , and {{{18}}} segments in the first 3 diagrams, and {{{3+9+18=30}}}, the formula works for {{{n=3}}} .
 
Could we have deduced that formula?
Yes, laboriously, but what was required was much simpler and easier.
To arrive at that formula, we could start by calculating the number of segments in the nth diagram
You add {{{n}}} triangles for row {{{n}}} in diagram number {{{n}}} .
The total number of triangles drawn to make diagram number {{{n}} is
{{{1+2+3+"....."+n=n(n+1)/2}}} , and that means
{{{3n(n+1)/2=(3/2)n^2+(3/2)n}}} 1-cm line segments (sides of those triangles).
{{{sum((3/2)k^2+(3/2)k, k=1, k=n )}}} is a sum of polynomials with degree 2,
so it must be a polynomial of degree 3.
We write {{{SUM[n]=sum((3/2)k^2+(3/2)k, k=1, k=n )=an^3+bn^2+cn+d}}} .
From {{{SUM[n]-SUM[n-1]=(3/2)n^2+(3/2)n}}} we would find out {{{a}}} , {{{b}}} , {{{c}}} , and {{{d}}} .