Triangles within triangles

Georgina says, "Whoa, look! I can put together all these equilateral triangles to make a bigger equilateral triangle."

What is the largest N N such that we cannot put together N N equilateral triangles (of any size) to form a bigger equilateral triangle?

If you think the answer is infinite, please put the answer as 99999.


The answer is 5.

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

Geoff Pilling
Nov 18, 2016

Take any mention of triangle referred to in this solution to mean "equilateral triangle".

You can add any odd number, 2 n + 1 ( n > 0 ) 2n+1 (n>0) of triangles to any existing triangle to make a new triangle by picking an edge and putting n n triangles along that edge and then n + 1 n+1 more to fill in that edge for the new triangle. Here is an example for n = 3 n=3 ( 7 7 new red triangles added to the bottom edge of the big green one):

Now lets evaluate the possibilities for N N in the original problem.

So, starting with 1 1 triangle, you can continue to add 3 3 to it, to get these possibilities: N = 1 , 4 , 7 , 10 , 13 , . . . N = 1, 4, 7, 10, 13, ...

You can add 5 5 triangles to 1 1 triangle to get N = 6 N=6 , and 7 7 to 1 1 to get N = 8 N=8 .

Now that you have a sequence of three possible values for N N (namely 6 , 7 6,7 and 8 8 ) you can make any higher number by adding 3 3 to the lowest of the three, in this case 6 6 , giving you 9 9 , producing a new sequence of three ( 7 , 8 7,8 and 9 9 ). Rinse wash and repeat! :)

The only numbers that can't be constructed in this way, then, are 2 , 3 2, 3 , and 5 5 , the largest of which is 5 \boxed{5}

And after playing around with these three numbers I convinced myself (without a rigorous proof... :-/ ) that there was no way to construct an equilateral triangle with any of these numbers of equilateral triangles.

Easier: The green triangle can be split into 4 triangles (halve each side), so you can generate 4 , 6 , 8 , 10 , 4, 6, 8, 10, \ldots by adding 2 n + 1 2n+1 to a single green triangle, or 7 , 9 , 11 , 13 , 7, 9, 11, 13, \ldots by adding 2 n + 1 2n+1 to a split green triangle.

Ivan Koswara - 4 years, 6 months ago

Nice problems that arise from things that you're thinking about.

I wonder if this problem is equivalent to the square problem, using some form of transformation on the grid.

Calvin Lin Staff - 4 years, 6 months ago

Log in to reply

I was wondering that myself... Both the answer and proof are surprisingly similar! :)

The interesting thing, though, is how many fewer people got this one vs. the square one... :-/

Geoff Pilling - 4 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...