Picking Coordinates 2

Geometry Level 5

As shown on the right, the equilateral triangle consists of 4 4 rows of unit equilateral triangles. When the centroid of the largest triangle is connected with its vertex and the adjacent midpoint of one of its sides, there are 4 4 vertex points that lie either wholly inside or on the perimeter of the right triangle.

For this problem, consider an equilateral triangle, consisting of 2021 2021 rows of unit equilateral triangles. How many vertex points lie either wholly inside or on the perimeter of the right triangle?

Inspiration.


The answer is 341381.

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.

2 solutions

Yuriy Kazakov
Jan 31, 2021

N = 2021 2021 + 1 2 N=2021 \cdot \frac{2021+1}{2} - number points in equilateral big triangle, consisting of 2021 2021 rows of unit equilateral triangles. M = 2021 + 1 2 M=\frac{2021+1}{2} - number of points on the median of a big triangle.

Answer 1 6 ( N + 5 M ) = 341381 \frac {1}{6 } (N+5M)=341381

K T
Feb 1, 2021

Let's first count the total number of vertex points. Above the top row (row 1) there is 1 vertex, above row 2 there are 2,... and finally below the bottom row (row n) there are n+1. When having n rows, the total number of vertices is v = 1 + 2 + . . . + n + ( n + 1 ) = n 2 + 3 n + 2 2 v=1+2+...+n+(n+1) = \frac{n^2+3n+2}{2}

Of all these vertices, some are private to a right-triangular region, some are shared with other regions. Let's investigate this. Note:

  • On a line dividing the triangle in two mirror images, there are 1 + n 2 1+ \lfloor \frac{n}{2} \rfloor vertices
  • There are three such lines and all vertices that are shared among regions are on such a line
  • There is a vertex in the centre exactly if n is a multiple of 3

We can now classify the vertices:

  • Shared by 6 right triangles: v 6 = 1 v_6=1 if n n is an integer multiple of 3, v 6 = 0 v_6=0 otherwise
  • Shared by 2 right triangles: v 2 = 3 ( 1 + n 2 v 6 ) v_2=3(1+ \lfloor \frac{n}{2} \rfloor-v_6)
  • All others are private to some right triangle: v 1 = n 2 + 3 n + 2 2 v 2 v 6 v_1=\frac{n^2+3n+2}{2}-v_2-v_6

Each of the 6 right triangular areas now contains or touches x vertices where x = v 1 6 + v 2 3 + v 6 x=\frac{v_1}{6}+\frac{v_2}{3}+v_6

Sanity check for small n and find the answer:

n n v v v 6 v_6 v 2 v_2 v 1 v_1 x x
0 1 1 0 0 1
1 3 0 3 0 1
2 6 0 6 0 2
3 10 1 3 6 3
4 15 0 9 6 4
5 21 0 9 12 5
6 28 1 9 18 7
7 36 0 12 24 8
.. .. .. .. .. ..
2021 2045253 0 3033 2042220 341381

If you like a closed expression for x: x = n 2 + 3 n + 8 + 6 n 2 + 4 n 3 4 n 1 3 12 x=\frac{n^2+3n+8 +6 \lfloor \frac{n}{2} \rfloor + 4\lfloor \frac{n}{3} \rfloor - 4\lfloor \frac{n-1}{3} \rfloor}{12}

For further reference, also see the OEIS

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...