TRY from all the ANGLES!!

Suppose there is an equilateral triangle with n = 111 n=111 in the manner shown in the figure above. How many triangles are in that triangle?

394336 394636 349636 366934

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.

1 solution

The no. of triangles can be obtained by applying any of the two formulas mentioned below:

METHOD 1:

n(∆) =(floor(n x (n+2) x (2n+1))/8)

n(∆) = floor(111 X 113 X 223)/8

n(∆) = floor(2797089)/8

n(∆) = floor(349636.125)

n(∆) = 349636

If you are not familiar with floor function then for your information; floor function in maths is the largest integer less than or equal to the input.

METHOD 2:

If n n is even, c n = 1 8 n ( n + 2 ) ( 2 n + 1 ) \displaystyle c_n = \frac{1}{8}n(n+2)(2n+1) .

If n n is odd, c n = 1 8 [ n ( n + 2 ) ( 2 n + 1 ) 1 ] \displaystyle c_n = \frac{1}{8}\left[n(n+2)(2n+1)-1\right]

Can you explain how you arrived at those formulas?

Calvin Lin Staff - 6 years, 8 months ago

Log in to reply

http://wj32.org/wp/2012/04/09/triangles-in-a-triangle/

A detailed explanation is given at the above link!!

jaiveer shekhawat - 6 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...