Reuleaux Rosie

Geometry Level 5

Reuleaux polygon done by Geogebra Reuleaux polygon done by Geogebra

While Mai and Joey were preparing for the party, Tea Gardner and Yugi Muto, both lovers, hung out at the church, where they stared at a stain-glassed Reuleaux pentagon window, filled with pink and red colors. The conversation started:

Tea : Wow! What a beautiful rose! Isn't it beautiful, Yugi?

Yugi : Yes, it is!

Tea : I have a math problem for you to try out. Suppose we start with five unit circles, where each center is intersected by two circular arcs. Then, this makes a Reuleaux pentagon.

Yugi : That is easy to remember...

Tea : But there's more! Draw another Reuleaux pentagon inside, where each vertex intersects the midpoint of the circular arcs. Repeat this infinitely, so we have much like the stain-glassed one. Here is the following:

[After minutes of perfect-sketching]

This is the main diagram to focus for the problem. This is the main diagram to focus for the problem.

Here is the rose with alternating red and white petals. Your goal is to compute the area of all red petals.

Yugi : Touche! What a long geometry problem you asked here! Is there a specific formula to generalize the area of the red petals after finite number of iterations?

Tea : If I give that away, then you will know the answer to this fun problem! Solve this correctly, and we will enjoy a nice party! :)

What is the area of all red petals in the second diagram, where the diagonal of the largest Reuleaux pentagon is 1? If your area is A A , input A 1 0 3 \left\lfloor A \cdot 10^3 \right\rfloor as your answer.


Preliminaries

A Reuleaux polygon is a curvilinear polygon formed by an odd number of circular arcs. Like a Reuleaux triangle , the apex points of a Reuleaux polygon are centers of identical circles.

For the main problem, determine the area of a Reuleaux pentagon.

Bonus: Generalize this for any odd number of vertices and circular arcs. You should notice that as the number of edges approaches \infty , a Reuleaux polygon becomes close to a circle of area π 4 r 2 \frac{\pi}{4}r^2 , where r r is the radius of the large circle.


This is the end of the fourth chapter of the story . Check chapter directory if you are interested:

First - Second - Third - Fourth - Fifth


The answer is 418.

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

Michael Huang
Feb 7, 2017

Relevant wiki: Length and Area - Composite Figures

A Reuleaux pentagon represents the combination of a regular pentagon and 5 5 minor segments. For this problem, we generalize the solution, given the following parameters:

  • d d is the diagonal length of a pentagon. Since a polygon is regular, d = 1 + 5 2 s d = \dfrac{1 + \sqrt{5}}{2}s where s s is the side length of a regular pentagon. This is easily proven by law of cosines .
  • c c is the circumradius of a pentagon. By law of cosines , we find that c = 1 10 50 + 10 5 c = \dfrac{1}{10}\sqrt{50 + 10\sqrt{5}}

  • A A denotes the area of a Reuleaux pentagon. The area of a pentagon is 1 4 25 + 10 5 s 2 \dfrac{1}{4}\sqrt{25 + 10\sqrt{5}}s^2 , and the area of a minor segment is π 10 d 2 1 2 d 2 sin ( 3 6 ) \dfrac{\pi}{10}d^2 - \dfrac{1}{2}d^2\sin\left(36^{\circ}\right) . Combining those expressions in terms of d d , the area of a Reuleaux pentagon is A = 1 2 d 2 ( π 25 10 5 ) A = \dfrac{1}{2}d^2\left(\pi - \sqrt{25 - 10\sqrt{5}}\right)


Recurrence Relation Construction


Consider the following diagram

where F , G , H , I F,G,H,I and J J are midpoints of circular segments, and O O is the centroid of two pentagons A B C D E ABCDE and F G H I J FGHIJ . Since the circumradius of the new pentagon decreases after each n n th iteration by d c d - c (indicated by G O = F O = F C C O = G D D O |GO| = |FO| = |FC| - |CO| = |GD| - |DO| ), the recurrence relation is c n + 1 = d n c n c_{n + 1} = d_n - c_n for each positive integer n 1 n \geq 1 , where d 1 = 1 d_1 = 1 and c 1 = 50 + 10 5 5 + 5 5 c_1 = \dfrac{\sqrt{50 + 10\sqrt{5}}}{5 + 5\sqrt{5}} . Because the lengths of both A B C D ABCD and F G H I J FGHIJ are directly proportional, the relationship is d n c n = d n + 1 c n + 1 = d n + 2 c n + 2 = \dfrac{d_n}{c_n} = \dfrac{d_{n + 1}}{c_{n + 1}} = \dfrac{d_{n + 2}}{c_{n + 2}} = \cdots Then, since we want to determine the area of all red petals, the total area is A red = n = 1 1 2 ( d n ) 2 ( π 25 10 5 ) ( 1 ) n 1 = n = 0 1 2 ( c n + 2 + c n + 1 ) 2 ( π 25 10 5 ) ( 1 ) n \begin{array}{rl} A_{\text{red}} &= \sum\limits_{n=1}^{\infty} \dfrac{1}{2}\left(d_n\right)^2\left(\pi - \sqrt{25 - 10\sqrt{5}}\right)(-1)^{n - 1}\\ &= \sum\limits_{n=0}^{\infty} \dfrac{1}{2}\left(c_{n + 2} + c_{n + 1}\right)^2\left(\pi - \sqrt{25 - 10\sqrt{5}}\right)(-1)^{n} \end{array}


Computation


The fun part of this problem is that the computation involves two variables - d n d_n and c n c_n . Instead of time-consuming substitution with the values of c c 's and d d 's, we can approach this the elegant way. Given that d 1 = 1 d_1 = 1 and c 1 = 50 + 10 5 5 + 5 5 c_1 = \dfrac{\sqrt{50 + 10\sqrt{5}}}{5 + 5\sqrt{5}} , then d n c n = 1 50 + 10 5 5 + 5 5 d n = 5 + 5 5 50 + 10 5 c n \begin{array}{rl} \dfrac{d_n}{c_n} &= \dfrac{1}{\dfrac{\sqrt{50 + 10\sqrt{5}}}{5 + 5\sqrt{5}}}\\ d_n &= \dfrac{5 + 5\sqrt{5}}{\sqrt{50 + 10\sqrt{5}}}c_n \end{array} which shows that since c n + 1 = c n ( 5 + 5 5 50 + 10 5 1 ) c_{n + 1} = c_n\left(\dfrac{5 + 5\sqrt{5}}{\sqrt{50 + 10\sqrt{5}}} - 1\right) then the recurrence relation in terms of c c only is the following geometric series c n = 50 + 10 5 5 + 5 5 ( 5 + 5 5 50 + 10 5 1 ) n 1 c_n = \dfrac{\sqrt{50 + 10\sqrt{5}}}{5 + 5\sqrt{5}}\left(\dfrac{5 + 5\sqrt{5}}{\sqrt{50 + 10\sqrt{5}}} - 1\right)^{n-1} Thus, the total area of the red petals is approximately 0.418 0.418 squared feet. The answer to the problem is A 1 0 3 = 418 \left\lfloor A \cdot 10^3 \right\rfloor = \boxed{418} .

Can you suggest a good source to learn something about the "Recurrence Relation"?
Thanks!

Akshay Krishna - 2 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...