# Pi vs. Pie

Courtesy Bedtime Math:

# Happy Pythagoras Day!

Happy Pythagoras Day! Today is 8/15/17 (or 15/8/17 in other parts of the world), and $8^2+15^2=17^2$.

We might as well celebrate today, because the next Pythagoras Day won’t happen for over 3 years. (Bonus points if you can figure out when it will be.)

# Constructing an angle’s trisectors

I really enjoyed this video about how to trisect angles. Trisection of arbitrary angles is impossible using only a straightedge and compass; however, it is possible by carefully folding a piece of paper.

http://mars.wne.edu/~thull/papers/amer.math.monthly.118.04.307-hull.pdf

https://en.wikipedia.org/wiki/Huzita%E2%80%93Hatori_axioms

# Solving a Math Competition Problem: Part 9

This series of posts concerns solving the following problem from the 2016 University of Maryland High School Mathematics Competition.

A sphere is divided into regions by 9 planes that are passing through its center. What is the largest possible number of regions that are created on its surface?

a. $2^8$

b. $2^9$

c. 81

d. 76

e. 74

This series was actually written by my friend Jeff Cagle, department head for mathematics at Chapelgate Christian Academy, as he tried technique after technique to solve this problem. I thought that his resolution to the problem was an excellent example of the process of mathematical problem-solving, and (with his permission) I am posting the process of his solution here. (For the record, I have no doubt that I would not have been able to solve this problem.)

Reflection
I didn’t really need the projection into the plane for the solution, but my problem-solving self needed it to be able to count points and regions in slow motion. So, I should present a cleaned-up solution:

Solution
Since there are 9 planes, each plane must intersect with every other in a line, creating two points on the surface of the sphere. Thus, there are (9∗8)/2 * 2 = 72 points of intersection, and for n planes, there are 𝑛(𝑛 − 1) points of intersection. With the first plane, there are zero points of intersection and two regions. Suppose we now have n planes and N regions. We add another plane, creating a circle on the sphere. For each segment that the circle intersects, it creates an additional intersection point as it enters, and it divides the region into two parts, adding one additional region. Hence, for each point added, a region is added as well. Since there are two
regions with zero points, there are thus 74 regions with 72 points of intersection.

# Solving a Math Competition Problem: Part 8

This series of posts concerns solving the following problem from the 2016 University of Maryland High School Mathematics Competition.

A sphere is divided into regions by 9 planes that are passing through its center. What is the largest possible number of regions that are created on its surface?

a. $2^8$

b. $2^9$

c. 81

d. 76

e. 74

This series was actually written by my friend Jeff Cagle, department head for mathematics at Chapelgate Christian Academy, as he tried technique after technique to solve this problem. I thought that his resolution to the problem was an excellent example of the process of mathematical problem-solving, and (with his permission) I am posting the process of his solution here. (For the record, I have no doubt that I would not have been able to solve this problem.)

OK, so I wanted to prove that each region would be a triangle. So I decided to project the sphere onto a plane.

The projection of four planes:

Conjecture: The max number of regions is the number of intersection points plus 2.
Proof (by induction)
If we have 1 plane, we have no intersection points and 2 regions. Suppose we have n planes with 𝑛(𝑛 − 1) intersection points and 𝑛(𝑛 − 1) + 2 regions. Now we add the next plane to our figure. The plane creates a circle on the sphere. To maximize the number of regions, we angle the plane so that our circle does not intersect any already-existing intersection points. So the circle goes through a number of segments. Each time it does, it cuts the region bounded by that segment into two. So for each new intersection point, we lose one region and gain two, for a net gain of one region. That is, however many intersection points are added, that will be the number of regions added as well. And since 𝑛 + 1 planes have (𝑛 + 1)(𝑛) intersection points, we will
have (𝑛 + 1)(𝑛) + 2 max regions. DONE.
For the original competition problem, we have 9 planes and hence 9*8 + 2 = 74 regions, answer e.

# Solving a Math Competition Problem: Part 7

This series of posts concerns solving the following problem from the 2016 University of Maryland High School Mathematics Competition.

A sphere is divided into regions by 9 planes that are passing through its center. What is the largest possible number of regions that are created on its surface?

a. $2^8$

b. $2^9$

c. 81

d. 76

e. 74

This series was actually written by my friend Jeff Cagle, department head for mathematics at Chapelgate Christian Academy, as he tried technique after technique to solve this problem. I thought that his resolution to the problem was an excellent example of the process of mathematical problem-solving, and (with his permission) I am posting the process of his solution here. (For the record, I have no doubt that I would not have been able to solve this problem.)

OK, so I wanted to prove that each region would be a triangle. So I decided to project the sphere onto a plane.

The projection of four planes:

After a while, I had a chart for max possible regions.

• 1 plane: Max regions = 2
• 2 planes: Max regions = 4
• 3 planes: Max regions = 8 (exponential?)
• 4 planes: Max regions = 14 (nope!)
• 5 planes: Max regions = 22 (huh?)

Then, really because I had no other ideas, I tried counting intersection points AND max regions
(remembering that one intersection point is “at infinity” – that is, the north pole).

• 1 plane: Intersection Points = 0, Max regions = 2
• 2 planes: Intersection Points = 2, Max regions = 4
• 3 planes: Intersection Points = 6, Max regions = 8
• 4 planes: Intersection Points = 12, Max regions = 14
• 5 planes: Intersection Points  20, Max regions = 22

Oh. My. Goodness. The max regions are simply the number of intersection points plus 2. Could it really REALLY be that simple?

# Solving a Math Competition Problem: Part 6

This series of posts concerns solving the following problem from the 2016 University of Maryland High School Mathematics Competition.

A sphere is divided into regions by 9 planes that are passing through its center. What is the largest possible number of regions that are created on its surface?

a. $2^8$

b. $2^9$

c. 81

d. 76

e. 74

This series was actually written by my friend Jeff Cagle, department head for mathematics at Chapelgate Christian Academy, as he tried technique after technique to solve this problem. I thought that his resolution to the problem was an excellent example of the process of mathematical problem-solving, and (with his permission) I am posting the process of his solution here. (For the record, I have no doubt that I would not have been able to solve this problem.)

OK, so I wanted to prove that each region would be a triangle. So I decided to project the sphere onto a plane.

The projection of four planes:

After a while, I had a chart for max possible regions.

• 1 plane: Max regions = 2
• 2 planes: Max regions = 4
• 3 planes: Max regions = 8 (exponential?)
• 4 planes: Max regions = 14 (nope!)
• 5 planes: Max regions = 22 (huh?)

# Solving a Math Competition Problem: Part 5

This series of posts concerns solving the following problem from the 2016 University of Maryland High School Mathematics Competition.

A sphere is divided into regions by 9 planes that are passing through its center. What is the largest possible number of regions that are created on its surface?

a. $2^8$

b. $2^9$

c. 81

d. 76

e. 74

This series was actually written by my friend Jeff Cagle, department head for mathematics at Chapelgate Christian Academy, as he tried technique after technique to solve this problem. I thought that his resolution to the problem was an excellent example of the process of mathematical problem-solving, and (with his permission) I am posting the process of his solution here. (For the record, I have no doubt that I would not have been able to solve this problem.)

OK, so I wanted to prove that each region would be a triangle. So I decided to project the sphere onto a plane.

For a while, I toyed with the situation where we have

• Plane 1 – equator (this always happens: Just make plane 1 the equator) 𝑃1(0𝑁, 0𝐸).
• Plane 2 – Prime Meridian 𝑃2(90𝑁, 0𝐸)
• Plane 3 – Intl Date Line 𝑃3(90𝑁, 90𝐸)
• Plane 4 – at an angle to all of those 𝑃4(45𝑁, 45𝐸)

Here is our mapping with P1, P2, and P3 on it:

Now, how to represent P4? Aha! The inside of the unit circle is the southern hemisphere, and the outside is the northern. P4 must hit the equator a two points 180 degrees apart, go inside the southern hemisphere, and then outside to the northern. Thus:

The white region is a NONtriangular region created by the intersection of four planes. These are strange-looking regions, and I spent a long time – several days – vainly trying to count max regions created when I added P5, P6 etc. But one thing was clear: not all of the regions are triangular, nor can they be. For if a plane (say P4) cuts through a triangular region, it will create a new triangular region and a non-triangular “quadrilateral”, as in the figure below. So counting triangles from points is NOT the solution here!

# Solving a Math Competition Problem: Part 4

This series of posts concerns solving the following problem from the 2016 University of Maryland High School Mathematics Competition.

A sphere is divided into regions by 9 planes that are passing through its center. What is the largest possible number of regions that are created on its surface?

a. $2^8$

b. $2^9$

c. 81

d. 76

e. 74

This series was actually written by my friend Jeff Cagle, department head for mathematics at Chapelgate Christian Academy, as he tried technique after technique to solve this problem. I thought that his resolution to the problem was an excellent example of the process of mathematical problem-solving, and (with his permission) I am posting the process of his solution here. (For the record, I have no doubt that I would not have been able to solve this problem.)

OK, so I wanted to prove that each region would be a triangle. So I decided to project the sphere onto a plane. There’s a standard way of doing that, used both by map-makers and mathematicians. Place the sphere with the south pole on the plane at the origin. Then for each point on the sphere, run a line from the north pole through that point to the plane. This gives a 1-1 mapping of sphere to plane. The diagram below shows this mapping, with the points A and B on the sphere mapping to the points A’ and B’ on the plane respectively.

Notice that in the mapping above, the south pole is mapped to the origin (“straight down”), while the north pole itself cannot be mapped. We call the north point the “point at infinity.” Also notice that the equator gets mapped to a circle. And, any circle around the sphere that goes through the north pole will also go through the south pole, and so becomes a line in the plane.