A Triangle and Two Regular Convex Polygons

Geometry Level 2

An equilateral triangle and 2 other regular polygons share a single vertex in such a way that the three shapes completely cover the 36 0 360^\circ of space surrounding the vertex without overlapping.

What is the largest possible number of sides that one of the regular polygons can have?

An equilateral triangle, regular 9-gon, and regular 18-gon can cover all \(360^\circ\) around a single vertex.  Is 18 the maximum number of sides one of these regular polygons can have? An equilateral triangle, regular 9-gon, and regular 18-gon can cover all 36 0 360^\circ around a single vertex. Is 18 the maximum number of sides one of these regular polygons can have?


The answer is 42.

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.

10 solutions

Consider the regular triangle, n 1 n_1 -gon, and n 2 n_2 -gon. The sum of their internal angles is ( 18 0 36 0 3 ) + ( 18 0 36 0 n 1 ) + ( 18 0 36 0 n 2 ) = 42 0 36 0 n 1 36 0 n 2 . \left(180^\circ - \frac{360^\circ}{3}\right) + \left(180^\circ - \frac{360^\circ}{n_1}\right) + \left(180^\circ - \frac{360^\circ}{n_2}\right) = 420^\circ - \frac{360^\circ}{n_1} - \frac{360^\circ}{n_2}. This must be equal to 36 0 360^\circ ; thus we have 36 0 n 1 + 36 0 n 2 = 6 0 . \frac{360^\circ}{n_1} + \frac{360^\circ}{n_2} = 60^\circ. Divide by 6 0 60^\circ and multiply by n 1 n 2 n_1n_2 to find 6 ( n 1 + n 2 ) = n 1 n 2 n 1 n 2 6 ( n 1 + n 2 ) = 0. 6(n_1 + n_2) = n_1n_2\ \ \ \ \ \therefore\ \ \ \ \ \ n_1n_2 - 6(n_1 + n_2) = 0. Complete the product: ( n 1 6 ) ( n 2 6 ) = 36. (n_1 - 6)(n_2 - 6) = 36. The factoring of 36 with the highest factor is 1 36 = 36 1\cdot 36 = 36 , so that n 1 6 = 1 n_1 - 6 = 1 and n 2 6 = 36 n_2 - 6 = 36 . This shows that n 1 = 7 n_1 = 7 and n 2 = 42 n_2 = \boxed{42} .

Great solution!

David Vreken - 3 years, 3 months ago

Can u prove that exterior angle of a regular n hon is 360/n ?.I know it is but please provide a proof

Saksham Jain - 3 years, 3 months ago

Log in to reply

Start on a side of the polygon and travel around its perimeter. At every vertex, you'll turn over an angle α \alpha . When you return at your starting point, you have turned over an angle n α n\alpha . You have also turned a whole angle. Thus n α = 36 0 n\alpha = 360^\circ .

Or, connect each of the vertices to the center of the polygon. By symmetry, the central angle is divided into n n angles of 36 0 / n 360^\circ/n . Each of the triangles that is formed is isosceles, with base angles 1 2 ( 18 0 36 0 / n ) \tfrac12(180^\circ - 360^\circ/n) . At each vertices two of these angles meet, making an internal angle of 18 0 36 0 / n 180^\circ - 360^\circ/n .

Arjen Vreugdenhil - 3 years, 3 months ago

Log in to reply

the first one proof is gold

Mehdi K. - 3 years, 3 months ago

Also for a non-regular n-agon the interior alngles sum up to 180(n-2) in a similar way :)!

Pau Cantos - 3 years, 3 months ago

But why is it that we are taking any arbitrary polygon yet after a complete rotation we come up to 360 degree??

erica phillips - 3 years, 3 months ago

Log in to reply

@Erica Phillips Consider a circle with a horizontal tangent across the top. Slide the tangent completely around the circle in either direction, until you arrive back at the starting point. The tangent has rotated 360 degrees. Now take an arbitrary polygon and lay a straight line flat against one edge. “Click” the straight line around to the next flat edge, and to the next, and to the next, until you arrive back at the edge where you started. The rotation wasn’t a smooth glide as it was with the circle - rather a series of “clicks” - but the result is exactly the same. The straight line has rotated 360 degrees. For a square, there are four clicks of 90 degrees apiece; for a decagon, there are 10 clicks of 36 degrees apiece. For an irregular polygon, the magnitude of the individual clicks will vary, but they will always sum to 360 after a complete rotation around the figure.

Albert Fisher - 3 years, 3 months ago

Log in to reply

@Albert Fisher Thanks a lot for this wonderful explanation!!!

erica phillips - 3 years, 3 months ago

Log in to reply

@Erica Phillips Most welcome!

Albert Fisher - 3 years, 3 months ago

Maybe this is only a coincidence, but the Hitchhiker's Guide to the Galaxy returns to BBC radio 4 this week!

Peter Macgregor - 3 years, 3 months ago

Log in to reply

I almost titled this question, "The Answer to the Great Question Of Life, the Universe, and Everything" :-)

David Vreken - 3 years, 3 months ago

The factorization 36 = ( n 1 6 ) ( n 2 6 ) 36 = (n_1-6)(n_2-6) shows that there are only five such arrangements involving equilateral triangles, one for each of the five positive factor pairs of 36.

36 = 1 36 n 1 = 7 , n 2 = 42 36 = 1 \cdot 36 \ \ \Rightarrow \ \ n_1 = 7, \ n_2 = 42 \ \ a heptagon and a 42-gon

36 = 2 18 n 1 = 8 , n 2 = 24 36 = 2 \cdot 18 \ \ \Rightarrow \ \ n_1 = 8, \ n_2 = 24 \ \ an octagon and a 24-gon

36 = 3 12 n 1 = 9 , n 2 = 18 36 = 3 \cdot 12 \ \ \Rightarrow \ \ n_1 = 9, \ n_2 = 18 \ \ a nonagon and an 18-gon

36 = 4 9 n 1 = 10 , n 2 = 15 36 = 4 \cdot 9 \ \ \Rightarrow \ \ n_1 = 10, \ n_2 = 15 \ \ a decagon and a 15-gon

36 = 6 6 n 1 = 12 , n 2 = 12 36 = 6 \cdot 6 \ \ \Rightarrow \ \ n_1 = 12, \ n_2 = 12 \ \ two dodecagons

If you generalize the problem to three regular polygons meeting at a point (but don't require one to be a triangle: n 0 = 3 n_0 = 3 ), there are these five arrangements and five more. They can be found similarly to Arjen's method. Just consider the additional cases of n 0 = 4 , 5 , 6 n_0 = 4, 5, 6 separately. One of the regular polygons must have 6 or fewer sides (otherwise all have interior angles greater than 12 0 120^\circ ), so we can stop at n 0 = 6 n_0 = 6 .

n 0 = 4 , n 1 = 5 , n 2 = 20 n_0 = 4, \ n_1 = 5, \ n_2 = 20 \ \ a square, a pentagon, and a 20-gon

n 0 = 4 , n 1 = 6 , n 2 = 12 n_0 = 4, \ n_1 = 6, \ n_2 = 12 \ \ a square, a hexagon, and a dodecagon

n 0 = 4 , n 1 = 8 , n 2 = 8 n_0 = 4, \ n_1 = 8, \ n_2 = 8 \ \ \ \ a square and two octagons

n 0 = 5 , n 1 = 5 , n 2 = 10 n_0 = 5, \ n_1 = 5, \ n_2 = 10 \ \ two pentagons and a decagon

n 0 = 6 , n 1 = 6 , n 2 = 6 n_0 = 6, \ n_1 = 6, \ n_2 = 6 \ \ \ \ three hexagons

Matthew Feig - 3 years, 3 months ago

Log in to reply

A comprehensive article on tiling regular polygons can be find here .

David Vreken - 3 years, 3 months ago

Log in to reply

Of course, "tiling" requires that the pattern can be continued indefinitely... there has to be a global symmetry of the plane, not just internal angles that add up to 36 0 360^\circ . That makes for a very different problem than the current question.

Arjen Vreugdenhil - 3 years, 3 months ago

Log in to reply

@Arjen Vreugdenhil The article includes a list of 3 regular polygons that can meet at 1 vertex, including the one given in the current question, but as an "unusable" tiling.

David Vreken - 3 years, 3 months ago

Log in to reply

@David Vreken Very interesting. It looks like there is a pretty easy test to determine if a vertex is usable for a tiling. The vertex must have either a) three even polygons, or b) one odd polygon and two identical even polygons.

a) 4-6-12, 4-8-8, 6-6-6

b) 3-12-12

Matthew Feig - 3 years, 3 months ago

Ok I’m new to this, so can someone explain what is wrong with my solution? As the number of sides increases on a polygon, the closer the angles get to 180degrees. If we say we have an infinity-gon with exactly 180degrees, and add that to the 60deg of our equilateral triangle, there are 120deg left, which is exactly the angle of a hexagon. Is this just a problem with using infinity or...?

Rick Lu - 3 years, 3 months ago

Log in to reply

The "infinity-gon" is not a regular polygon, so you have to find the next solution, which happens to be a heptagon (one more side than the hexagon you found) and a 42-gon.

David Vreken - 3 years, 3 months ago

If a regular hexagon is tangent to a circle in one its vertices, one can indeed precisely wedge in an equilateral triangle. In that sense your approach corresponds to a real geometric configuration. However, a circle is not a polygon.

Your approach corresponds to a "factoring" of 36 = ( n 1 6 ) ( n 2 6 ) = 0 36 = (n_1 - 6)(n_2 - 6) = 0\cdot \infty . But \infty is not a number and an \infty -gon is not a polygon.

Arjen Vreugdenhil - 3 years, 3 months ago

I tried the same way but by taking the interior angles as [(n-2)*180]/n. In the end I got the equation 3n+3n'-5nn'=12 Can you help me with it. Thanks!

Shanu Jindal - 3 years, 3 months ago

Log in to reply

( n 2 ) 180 n = 180 n 360 n = 180 360 n \frac{(n - 2)180}{n} = \frac{180n - 360}{n} = 180 - \frac{360}{n} (after distributing). Now you have the starting terms of @Arjen Vreugdenhil 's solution, and hopefully you are able to follow it from there.

David Vreken - 3 years, 3 months ago

Log in to reply

Yeah I figured that much but I was just curious that is there any way to solve the equation I got??

Shanu Jindal - 3 years, 3 months ago

Log in to reply

@Shanu Jindal To solve 3 n + 3 n 5 n n = 12 3n + 3n' - 5 nn' = 12 , note that 5 ( n 3 5 ) ( n 3 5 ) = 5 n n + 3 n + 3 n 9 5 . -5(n - \tfrac35)(n' - \tfrac35) = -5nn' + 3n + 3n' - \tfrac95. Therefore your equation becomes 5 ( n 3 5 ) ( n 3 5 ) = 12 9 5 = 51 5 . -5(n - \tfrac35)(n' - \tfrac35) = 12 - \tfrac95 = \tfrac{51}{5}. This equation has infinitely many solutions. The real solutions form an orthogonal hyperbola in the ( n , n ) (n,n') plane, with asymptotes at n , n = 3 5 n, n' = \tfrac35 .

If you only want integer solutions, multiply both sides by 5 -5 to obtain ( 5 n 3 ) ( 5 n 3 ) = 51. (5n - 3)(5n' - 3) = -51. Factoring gives 51 = 51 1 = 17 3 = 3 17 = 1 51 -51 = -51\cdot 1 = -17\cdot 3 = -3\cdot 17 = -1\cdot 51 . Only 3 -3 and 17 17 are of the form 5 k 3 5k - 3 for some integer k k ; thus we find { 5 n 3 = 3 5 n 3 = 17 { n = 0 n = 4 \begin{cases} 5n - 3 = -3 \\ 5n' - 3 = 17 \end{cases}\ \ \ \ \therefore\ \ \ \ \begin{cases} n = 0 \\ n' = 4 \end{cases}

Arjen Vreugdenhil - 3 years, 3 months ago

When n2 is infinite (polygon is a circle), n1 =6 a hexagon. My answer was that an infinite number of sides is the maximum that meets the criterion ...

Andy Smith - 3 years, 3 months ago

Log in to reply

A circle is not a polygon, though. It is only the limit of a series of polygons.

Arjen Vreugdenhil - 3 years, 3 months ago

i think the number is infinite....

Jiaguangyi Xiao - 3 years, 3 months ago

Log in to reply

Infinity is not a number, an an \infty -gon is no longer a polygon.

Arjen Vreugdenhil - 3 years, 3 months ago
Robert Williams
Mar 4, 2018

The polygon with fewer sides must have an exterior angle less than 60 degrees (the angle of the equilateral triangle), and the closer it is to 60 the smaller the contribution from the second polygon, and so the more sides it will have.

A hexagon has an external angle of exactly 60 degrees, so the first polygon must have seven sides with external angle 360 / 7 360/7 (about 51.4...)

The second polygon has an external angle of 60 360 / 7 60 - 360/7 (8.57...) so the number of sides is 360 / ( 60 360 / 7 ) 360 / (60 - 360/7) = 42

Excellent solution!

David Vreken - 3 years, 3 months ago

Log in to reply

Thank you. Excellent question — possibly the Ultimate Question of Life, the Universe and Everything?

Robert Williams - 3 years, 3 months ago

Log in to reply

LOL! I almost titled this question that

David Vreken - 3 years, 3 months ago
David Vreken
Feb 21, 2018

Let m m be the number of sides of one of the regular convex polygons, and n n be the number of sides of the other regular convex polygon. Then each of their interior angles are π ( m 2 ) m \frac{\pi(m - 2)}{m} and π ( n 2 ) n \frac{\pi(n - 2)}{n} , respectively, and the interior angle of the equilateral triangle is π 3 \frac{\pi}{3} . In the given problem, all three of these interior angles must add exactly to the space surrounding a point, which is 2 π 2\pi , and so π ( m 2 ) m + π ( n 2 ) n + π 3 = 2 π \frac{\pi(m - 2)}{m} + \frac{\pi(n - 2)}{n} + \frac{\pi}{3} = 2\pi , and this simplifies to m = 6 n n 6 m = \frac{6n}{n - 6} .

Since m = 6 n n 6 m = \frac{6n}{n - 6} , m > 0 m > 0 only when n > 6 n > 6 . Therefore, since m > 3 m > 3 (since m m represents a side of a regular convex polygon), n > 6 n > 6 . Also, since m = 36 ( n 6 ) 2 < 0 m’ = \frac{-36}{(n - 6)^2} < 0 , it is always decreasing, which means that the maximum possible m m value occurs at the first possible n n value after n > 6 n > 6 , and since n n is an integer (since n n represents a side of a regular convex polygon), this is when n = 7 n = 7 . Therefore, the largest number of sides is m = 6 7 7 6 = 42 m = \frac{6 \cdot 7}{7 - 6} = \boxed{42} .

Good problem! My approach was almost identical, except for the last part:

m = 6 n n 6 m = \frac{6n}{n-6}

There is a very simple (but maybe not obvious?) way of finding integer solutions to this type of equation:

m = 6 n 36 + 36 n 6 = 6 ( n 6 ) + 36 n 6 = 6 + 36 n 6 m = \frac{6n-36+36}{n-6} = \frac{6(n-6)+36}{n-6} = 6+\frac{36}{n-6}

It is now easy to see that the maximum value for n n which gives us an integer solution for m m is when n 6 = 36 n-6=36 , i.e. n = 42 n=42

Ivan Lobaskin - 3 years, 3 months ago

Log in to reply

Nice! @Max Patrick had a similar solution to yours.

David Vreken - 3 years, 3 months ago

Log in to reply

I hadn't seen that. I'll give him an upvote

Ivan Lobaskin - 3 years, 3 months ago

Sorry, probably it's that I'm not specialy farmiliarized with english lenguage but i didn't undertanded the problem well. I think the final question is not very specific. I thought that it was asking for a much more general question, the maximum number of sides a polygon could be so that there were some other polygons (any number or size of them) that could be arranged as such.

I don't if know I've explained well my confusion but the fact is that after a non-proportional effort to an intermediate problem I end up with the same solution! And I'm pretty sure that it's correct I mean n 1 = 3, n 2 = 7, n_3 = 42 is the optimal arrangement for any set of polygons! Maybe 42 is definitely the solution to the Ultimate Question of Life, the Universe and Everything:).

Anyway I think changing only "What is the largest possible number of sides that one of the regular polygons can have?" for "What is the largest possible number of sides that one (of the other two) regular polygons can have?" would be enough for a better understanding. Or maybe you could add a bonus question to the generalization I've tryed to explain a bit here. Thanks and nice problem.

Pau Cantos - 3 years, 3 months ago
Max Patrick
Mar 5, 2018

The 3 internal angles sum to 360deg. The two unknown polygons are an m-gon and an n-gon.

(180m-360)/m + (180n-360)/n + 60 = 360 in degrees.

Boils down to mn - 6m = 6n m = 6 + 36/(n-6) The highest n such that m is an integer is n=42. m=7.

Answer is 42 sides.

Another good solution!

David Vreken - 3 years, 3 months ago
Akshay Rawal
Mar 5, 2018

Consider the following implications :-

  1. The sum of interior angles of the two polygons is 360 -60 = 300 degrees.

  2. No interior angle can be greater than or even equal to 180, as minimum possible exterior angle for a polygon (with infinite sides) is 0 degrees, as 360 i n f i n i t e n o . o f s i d e s \frac{360}{infinite no. of sides} = 0

Therefore, The two conditions for two respective interior angles A and B are
A + B = 300 degrees A , B < 180 degrees Let us suppose one of them is 180 degrees, ie A = 180 degrees, then B = 300 - 180 = 120 degrees.

Interior angle for a polygon with n no. of sides = 180 ( n 2 ) n \frac{180 * (n - 2)}{ n } = 120 , which yields n = 6 Therefore, when no of sides of one polygon is maximum, the minimum no. of sides for another polygon can only be 6. But we cannot have infinite sides on any polygon, so

Let us take the next minimum number of sides on the other polygon , 7; Interior angle of a polygon with 7 sides = 180 5 7 \frac{180 * 5}{7} , hence the interior angle for the second maximum no of sides of a polygon would be = 300 - 180 5 7 \frac{5}{7}

= 2100 900 7 \frac{2100 - 900}{7}

= 1200 7 \frac{1200}{7}

Now, 180 ( n 2 ) n \frac{180 * (n - 2)}{ n } = 1200 7 \frac{1200}{7}

Therefore, n 2 n \frac{n - 2}{n} = 20 21 \frac{20}{21} , which yields n = 42

Nicely done!

David Vreken - 3 years, 3 months ago

Log in to reply

Thanks :) .... I didn't know the formula, so tried to solve it some way or the other.

Akshay Rawal - 3 years, 3 months ago

Let n n be a side of the orange regular polygon and m m a side of the green regular polygon.

60 + n 2 n 180 + m 2 m 180 = 360 n 2 n + m 2 m = 5 3 n + m n m = 1 6 6 n = m ( n 6 ) 60 + \dfrac{n - 2}{n} 180 + \dfrac{m - 2}{m} 180 = 360 \implies \dfrac{n - 2}{n} + \dfrac{m - 2}{m} = \dfrac{5}{3} \implies \dfrac{n + m}{nm} = \dfrac{1}{6} \implies 6n = m(n - 6)

m = 6 n n 6 \implies m = \dfrac{6n}{n - 6} ,where n > 6 n > 6 .

For n > 6 n> 6 , the sequence m ( n ) = 6 n n 6 m(n) = \dfrac{6n}{n - 6} is monotonic decreasing \therefore the maximum occurs when n = 7 n = 7 and m ( 7 ) = 42 m(7) = \boxed{42}

Rocco Dalto - 3 years, 3 months ago

Log in to reply

Nice! That's similar to how I did it, too.

David Vreken - 3 years, 3 months ago
Ahmed El-Bouhy
Mar 10, 2018

As the interior angles of a regular polygon (the interior angle represented by a) must fit: a < 180 Then we must find the largest interior angle shape. We look through what it can be, and the first polygon that fits is a heptagon, with its interior angles being ( 7 2 ) 180 7 \frac{(7-2)*180}{7}

From here, we know that the current angle total we have is about 188.57142 degrees.

We subtract this from 360, giving 171.42857 degrees per each interior angle of this shape.

To find the number of sides this shape has, we first figure out the exterior angles, by doing 180-171.42857=8.57143

Since exterior angles add up to 360, we can figure out how many exterior angles there are, by doing 360 8.57143 \frac{360}{8.57143}

This gives us 42 exterior angles, which is by extension 42 sides.

Good solution!

David Vreken - 3 years, 3 months ago

The external angles (i.e. 180 - internal angle) of the polygons have to sum to 60 degrees i.e. internal angle of the triangle. The external angle of an n sided polygon is 360/n degrees. Hence 360 n \frac{360}{n} + 360 m \frac{360}{m} =60 where n and m are integers representing the number of sides of the two polygons. Thus 1 n \frac{1}{n} + 1 m \frac{1}{m} = 1 6 \frac{1}{6} . Clearly n and m MUST both be larger than 6 for this equation to hold. So if n=7 then m=42. If n=8 then m=24 all the way to n=42 and m=7. So as one number increases, the other decreases. Hence the largest polygon will have n or m =42 sides.

Great solution!

David Vreken - 3 years, 3 months ago

Log in to reply

I am trying to figure out how to include a diagram to show exactly how I define an "external" angle just in case some people don't understand what I mean by that term. But for some reason the system is not showing my diagrams...........Ahh. Got it to work!!!

David Punshon-Smith - 3 years, 3 months ago
Nathan Speer
Mar 9, 2018

N1 = 6 and N2 = infinity works too.

If the number of sides approaches infinity, then the shape would be a circle, not a regular polygon, and can be ruled out as an option.

David Vreken - 3 years, 3 months ago

Log in to reply

Does the definition of a regular polygon have a limit on the number of sides it can have?

Nathan Speer - 3 years, 3 months ago

Log in to reply

Yes - "in elementary geometry, a polygon is a plane figure that is bounded by a finite chain of straight line segments closing in a loop to form a closed polygonal chain or circuit".

David Vreken - 3 years, 3 months ago

We have two regular polygones and a triangle, where the contribution of their angles are

6 0 + ( 18 0 36 0 / n 1 ) + ( 18 0 36 0 / n 2 ) = 36 0 . 60^\circ + (180^\circ - 360^\circ /n_1) + (180^\circ - 360^\circ / n_2) = 360^\circ .

It is clear that, when n 1 n_1 increases, then n 2 n_2 decreases. Moreover, they follow

n 1 = n 2 1 6 n 2 1 . n_1 = \dfrac{n_2}{\tfrac{1}{6}n_2 -1}.

The limiting case is when n 1 n_1 \rightarrow \infty , i.e. a circle, in that case, the sum of the angles would be 6 0 + 18 0 + 24 0 = 36 0 60^\circ + 180^\circ + 240^\circ = 360^\circ , where 24 0 240^\circ corresponds to n 2 = 6 n_2 = 6 . Therefore, the solution is the pair corresponding to the next integer, i.e. n 2 = 7 n_2 = 7 and n 1 = 42 n_1 = 42 ; the sum of the angles would be 6 0 + 171.4 3 + 128.5 7 = 36 0 60^\circ + 171.43^\circ + 128.57^\circ = 360^\circ .

Good solution!

David Vreken - 3 years, 3 months ago
Liam Donnelly
Mar 7, 2018

The total angle of the two remaining polygons must be 300. No shape can have an angle greater than or equal to 180 (without having an infinite number sides which is impossible). Therefore we can deduce that the shape with the fewest number of sides must have more than 6 sides (as a shape with 6 sides has angles of 120 degrees which would leave 180 degrees remaining)

We have already been shown that an 8 side shape will work so we only have to test with a 7 sided shape.

The angle in a heptagon is roughly 128.5. Therefore the other shape must have angles of 300-128.5= 171.5 degrees The total angle of this shape is therefore the number of sides (n) multiplied by 171.5 However we also know that the total interior angle of a polygon is 180(n-2)

Set these equations as equal to each other and solve 171.5n = 180(n-2)

171.5n = 180n - 360

360 = 8.5n

42.3...= n

Therefore the larger number of sides is 42

Nice thinking! It would be better to express the interior angle of the heptagon as a fraction ( 128 4 7 128\frac{4}{7} ) so that later on you get the exact answer of 42, instead of an approximate answer of 42.3.

David Vreken - 3 years, 3 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...