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.
It is known that regular zonogons, like the 1 4 -sided regular polygon, can be dissected into rhombi. However, there is not yet a clear (elementary) proof of how many distinct possible numbers of rhombi (of any interior angle) are there for a regular zonogon of 2 n sides. It's pretty interesting to see that for this problem, the solution is unique.
Here is the next problem I came up with. As my previous problems and this problem caught my attention, I will look more into generalized tilings.
Log in to reply
After hours of searching for some interesting articles to read, I encountered that rhombus tilings of a zonogon has more to do with projection. Here is the article for those who are interested. Japanese mathematics is truly elegant filled with magical tricks.
Actually what baffles me about both your solution (and mine) is:
Is there exactly 1 solution to ( A , B , C ) ? Is there a different tessellation that yields a different ( A , B , C ) ?
Furthermore, Michael Huang's follow-up problem leds me to think that the answer (to that harder question) is 1 too. But I've found another 2 solutions by running some script. But "3" is not the right answer either. Sigh.
Log in to reply
That's a beautiful solution. I have a similar question - how do we know it's unique? (I agree that it is, but I wonder if there's a short way of proving it).
@Pi Han Goh - is that the right follow-up problem? It doesn't have 1 or 3 solutions... (or have I misunderstood you? What additional 2 solutions do you mean)?
Log in to reply
The answer is neither 1 nor 3. I cannot get the answer. I'm not spoiling the (numerical) answer here.
What other 2 solutions? I've referring to: "I've found three 7-tuplets of (n1,n2,...,n7) that satisfies his equation in his other question"
Log in to reply
@Pi Han Goh – Ugh, I've definitely misunderstood, sorry. And don't worry, that's not much of a spoiler!
I was asking about your boxed question (about the uniqueness of ( A , B , C ) in this problem). It looked like you meant you'd found other tessellations for this 1 4 -gon question.
Log in to reply
@Chris Lewis – Oh no need to apologize. My message wasn't clear. (I will edit my comment above)
To be clear, I've found one solution of ( A , B , C ) to this very problem that we're looking at right now. But I didn't prove its uniqueness.
For Michael Huang's follow-up question , I found 1 solution by myself and found another 2 solutions via a script. But the answer isn't 3 either. So I'm pretty stumped.
Log in to reply
@Pi Han Goh – Come to think of it, David Vreken's question is much suitable to be phrased as:
Partition a regular 14-gon into quadrilateral such that the following is evident 2 ⋅ [ sin ( 7 π ) + sin ( 7 2 π ) + sin ( 7 3 π ) ] = cot ( 1 4 π )
"Is there exactly 1 solution to ( A , B , C ) ?" For positive integers A , B , and C , yes. I don't have an elegant proof for it yet, but at least for now here is a quick Python code that checks all the possible positive integer values for A , B , and C , and A = B = C = 7 is the only solution:
1 2 3 4 5 6 7 8 |
|
Log in to reply
Replace
if abs(G - V) < 0.0001:
with
if math.isclose(V,G):
and it works too.
Log in to reply
@Pi Han Goh – I didn't know about that function, thanks!
@Michael Huang Can you give me some insight on how you found this tiling, I find it quite amusing to think that a fellow human being did this, was it with computer graphics or with pen and paper
Log in to reply
As a unit rhombus consists of all equivalent sides and two pairs of equivalent opposite angles, in a regular unit zonogon of 2 n sides, the number of possible distinct rhombus choices (including a square, which is a rhombus) to fill in a side of a unit length is as follows:
⎩ ⎨ ⎧ ⌊ 2 n ⌋ 2 n for n odd for n even
where possible interior angles are in the form of n π ≤ n k π ≤ 2 π for integers k = 1 , 2 , … , ⌊ 2 n ⌋ . The more complex concept involves combinatorial tiling.
Harold Coxeter found that we can tile 2 1 parallelograms in a 1 4 -sided regular polygon (which came from 2 7 ⋅ 6 = 2 1 ). In this case, we see that the shape can be tiled, using 2 1 rhombi. The special case that A = B = C more likely follows that 7 is a prime number. Also consider a regular unit polygon, having 3 4 sides. Then, the number of each interior angle of an arithmetic progression between 1 7 π and 1 7 8 π is 1 7 . Thus,
2 1 7 cot 3 4 π = 1 7 n = 1 ∑ 8 sin 1 7 n π
The solution is not unique for 2 n -gon if n is not prime.
Great solution! For those interested, here are some more other tilings of the tetradecagon (taken from here ) using the same 2 1 rhombi as this solution:
On the point of uniqueness, firstly this has a very Galois feel. But given I've forgotten all that, assume there is a second solution in integers ( A ′ , B ′ , C ′ ) , that is P = A sin 7 π + B sin 7 2 π + C sin 7 3 π = A ′ sin 7 π + B ′ sin 7 2 π + C ′ sin 7 3 π
So ( A − A ′ ) sin 7 π + ( B − B ′ ) sin 7 2 π + ( C − C ′ ) sin 7 3 π = 0
ie we can find integers ( X , Y , Z ) , not all zero, such that X sin 7 π + Y sin 7 2 π + Z sin 7 3 π = 0
Multiply by 2 cos 1 4 π to get X ( − sin 1 4 π + sin 1 4 3 π ) + Y ( − sin 1 4 3 π + sin 1 4 5 π ) + Z ( − sin 1 4 5 π + sin 1 4 7 π ) = 0
and rearrange (noting sin 1 4 7 π = 1 ) to X sin 1 4 π − Z = ( X − Y ) sin 1 4 3 π + ( Y − Z ) sin 1 4 5 π
Similarly, multiplying by 2 sin 1 4 π we get X cos 1 4 π = ( X − Y ) cos 1 4 3 π + ( Y − Z ) cos 1 4 5 π
Squaring and adding (yes, really), lots of things cancel; we get X 2 − 2 X Z sin 1 4 π = ( X − Y ) 2 + ( Y − Z ) 2 + 2 ( X − Y ) ( Y − Z ) cos 7 π
In other words, 2 X Z sin 1 4 π + 2 ( X − Y ) ( Y − Z ) cos 7 π
is an integer. But cos 7 π = 1 − 2 sin 2 1 4 π , which implies either that
1) sin 1 4 π is the root of a quadratic or linear function with rational coefficients
or
2) X Z = ( X − Y ) ( Y − Z ) = 0
We know the first of these can't be the case (heptagons aren't constructible with ruler and compass); so X Z = ( X − Y ) ( Y − Z ) = 0
From this, either X = 0 and Y = Z or Z = 0 and X = Y . But returning to the equation X 2 − 2 X Z sin 1 4 π = ( X − Y ) 2 + ( Y − Z ) 2 + 2 ( X − Y ) ( Y − Z ) cos 7 π
and substituting either of these gives the unique solution X = Y = Z = 0 .
So after all that, the representation of any number in the form A sin 7 π + B sin 7 2 π + C sin 7 3 π
with integer ( A , B , C ) is unique.
Log in to reply
That took way longer than I expected. I had hoped for an amazing magic-trick style reveal, but instead it's more like watching someone find your card by conducting painstaking fingerprint and DNA analysis on the whole deck while you wait.
Shortcuts, anyone?
Wow, brilliant proof!
A 14-sided regular unit polygon is made of 14 isosceles triangle with vertex angle measuring 7 π and base of 1 . Then the area of the polygon is:
A = 1 4 ⋅ 2 1 ⋅ P Q ⋅ O N = 1 4 ⋅ 2 1 ⋅ 2 1 cot 1 4 π ⋅ 1 = 2 7 cot 1 4 π = 2 7 tan 7 3 π = 2 7 ⋅ cos 7 3 π sin 7 3 π = 7 ⋅ cos 7 3 π sin 7 3 π ( cos 7 π + cos 7 3 π + cos 7 5 π ) = 7 ⋅ cos 7 3 π sin 7 3 π ( cos 7 π + cos 7 5 π ) + 7 sin 7 3 π = 7 ⋅ cos 7 3 π sin 7 3 π ⋅ 2 cos 7 3 π cos 7 2 π + 7 sin 7 3 π = 1 4 sin 7 3 π cos 7 2 π + 7 sin 7 3 π = 1 4 cos 1 4 π cos 7 2 π + 7 sin 7 3 π = 7 ( cos 1 4 3 π + cos 1 4 5 π ) + 7 sin 7 3 π = 7 sin 7 2 π + 7 sin 7 π + 7 sin 7 3 π Note that tan θ = cot ( 2 π − θ ) and cos 7 π + cos 7 3 π + cos 7 5 π = 2 1 and cos ( A − B ) + cos ( A + B ) = 2 cos A cos B and sin θ = cos ( 2 π − θ )
Therefore A + B + C = 7 + 7 + 7 = 2 1 .
Disclaimer: I've only found 1 triplet of ( A , B , C ) , but I didn't prove that this triplet is unique.
The area of a regular N -sided polygon with side length s is given to be A = 4 1 N s 2 cot ( N π ) .
In this case, N = 1 4 , s = 1 , so A = 2 7 cot ( 1 4 π ) .
Through a complete leap of faith, I suspect that A = B = C . This leads me to think about the sum of sines of angles in an arithmetic progression :
k = 0 ∑ n − 1 sin ( a + k d ) = sin ( d / 2 ) sin ( n d / 2 ) sin ( a + 2 n − 1 d )
Substitute a = d = 7 π , and n − 1 = 5 , we have sin ( 7 π ) + sin ( 7 2 π ) + ⋯ sin ( 7 6 π ) 0 = = sin ( π / 1 4 ) sin ( 6 π / 1 4 ) = 1 sin ( 7 π + 2 5 ⋅ 7 π ) sin ( π / 1 4 ) cos ( π / 1 4 ) = cot ( 1 4 π )
Using the complementary angle formula, sin X = sin ( π − X ) , the left-hand side of the equation above can be expressed as 2 ⋅ [ sin ( 7 π ) + sin ( 7 2 π ) + sin ( 7 3 π ) ] = cot ( 1 4 π )
Multiply both sides by 2 7 yields 2 7 cot ( 1 4 π ) = A = 7 sin ( 7 π ) + 7 sin ( 7 2 π ) + 7 sin ( 7 3 π )
Hence, A = B = C = 7 ⇒ A + B + C = 2 1 .
I think I've got a proof of uniqueness (see under Michael Huang's solution), but it is messy . Perhaps some of the ideas could be used better, though.
Log in to reply
I think that comment deserves to be a solution of its own. I'm still digesting it...
Problem Loading...
Note Loading...
Set Loading...
The 1 4 -sided polygon can be tiled with 7 cyan unit rhombi of interior angle 7 π , 7 blue unit rhombi of interior angle 7 3 π and 7 purple unit rhombi of interior angle 7 2 π as follows:
Following the triangle area formula , since
The total area is
7 sin 7 π + 7 sin 7 2 π + 7 sin 7 3 π
where A = B = C = 7 gives A + B + C = 2 1 .