1 3 5 sticks. How many sticks form the side of this triangle?
It was made a serie of stick's triangles following the sequence in the figure. One of these triangles was built with
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We can representate the number of sticks of each triangle as 3 × n + m where n is the number of stick in each side and m is the number of sticks in the subsequent triangle.
Applying the formula we have the following number of sticks in each triangle:
3 , 9 , 1 8 , 3 0 , 4 5 , 6 3 , 8 4 , 1 0 8 , 1 3 5 . . .
Then:
3 n + 1 0 8 = 1 3 5
3 n = 2 7
n = 9
The answer is 9
I have made my own formula XD
Recurrence relations are nice, but what about if I've told you that one of these triangles was built with, as an example, 1305 sticks, how would you guess the number of sticks on the side of the triangle?
Log in to reply
It would be very hard, and because of this my formula is not usual :/
Problem Loading...
Note Loading...
Set Loading...
The number of triangles increases by the previous increase plus one unit, and becomes the triangular number . Since each triangle is built with three sticks, the formation pattern is given by:
S ( n ) = 2 3 . n . ( n + 1 ) .
Then, we have:
1 3 5 = 2 3 . n . ( n + 1 ) → n 2 + n − 9 0 = 0 → n = 9 .
Note : the other root of the polynomial is negative and, thus, discarded.