Friday, January 2

Quadrature

I lied again, I'm sorry. I'll try and post at least one more time during my elongated period of doing nothing. That very well could be a lie, but I'm going to try anyway.

I just got a book about famous math axioms for Christmas, and I saw something kind of cool in there. That reminded me of my promise during Thanksgiving to post, which I obviously broke. Sorry about that again.

~~~~~~~~~~

A really, really long time ago, the ancient Greeks were obsessed with geometry and number theory. This led to the idea of quadrature, the idea that for a (usually arbitrary) figure, a square could be constructed off of that figure with an area equal to it. For example, if you wanted a quadrature of a 9x4 rectangle, you would have to construct a square with side length 6. However, that's not really the point of quadrature-- you're supposed to be able to do it with an arbitrary figure.

Another thing to note is the nature of the constructions. You have to do it with only a straightedge and a compass, with no angles or lengths measurable. However, before we start, there are a lot of simple, pre-established things you can do with your two tools, so when I say "construct a midpoint" or something like that, just assume for the sake of the conversation (monologue, really) that it's possible, no questions asked. OK? OK.

~~~~~~~~~~

The first thing you need to learn is rectangles. They're pretty easy.

1. You have your arbitrary rectangle, ABCD.
2. Extend the edges from corner D to a reasonably long length.
3. Construct a circle with center D and radius CD. (The red dotted circle)
4. Mark point E where BD's extension and the circle intersect.
4. Construct F as the midpoint of BE.
5. Construct a circle with center F and radii BF and EF. (The blue dotted circle)
6. Mark point G where CD's extension and circle F intersect.
7. Construct a square with side DG. This square has the same area as ABCD.

~~~~~~~~~~~

Squaring the triangle is just building off of the rectangle.
1. Start with your arbitrary triangle, ABC.
2. Construct the altitude to point C.
3. Construct the midpoint of the altitude.
4. Construct the rectangle with height ED and base AB.
             At this point, compare on the basic formulae for the areas of a triangle and a rectangle, A=b*h/2   and    A=bh. One way to make the areas equal would haves the bases the same length and the height of the triangle be twice that of the rectangle. This is exactly what we have already constructed.
             From here you can just square the rectangle and everything's hunky-dory.

~~~~~~~~~~~~

Much more annoying is the arbitrary polygon itself.
In this case, we have ourselves a random heptagon. It doesn't look very quadrable, in my opinion. In fact, it looks like a mass of lines connected together. But wait! Look at what happens:
And now we have 5 triangles with areas V, W, X, Y, and Z. And we already know how to square those.
Now we have five squares with side lengths v, w, x, y, and z, the square roots of their capital letters. That's a good thing and a bad thing, because finally have a square, but too many of them. This is where we get to the interesting part.

At this point, think about the Pythagorean theorem--   a^2+b^2=c^2.

In the diagram:
w^2 + v^2 = a^2   and   a^2 + x^2 = b^2   , so
b^2 = w^2 + v^2 + x^2 = W + V + X

And:
b^2 = w^2 + v^2 + x^2   and   b^2 + y^2 = c^2  , so
c^2 = w^2 + v^2 + x^2 + y^2 = W + V + X + Y

If you don't see where this is going, then I'll explain it. Basically, by the Pythagorean theorem, a square with side length a would have and area of W+V, a square with side length b would have an area of W+V+X, and so on. Therefore, the area of a square with side length d would be equal to the sum of the areas of the smaller squares, and those are equal to the sum of the triangles, which is the area of the polygon. Neato!

~~~~~~~~~~~~

I'll continue this post tomorrow, don't worry.

Sunday, November 23

**UPDATE** and some random stuff

So it's been a WHILE

I started this post in September, and I was so close to finishing it, but I obviously forgot to actually post it! I've had actually NO time to do anything since maybe September, and I'm still really tired right now because I had a competition that was a couple of hours away, and I had to do stuff, and yeah.

I'm probably going to past at least 2 more times over Thanksgiving break, so don't worry about consistency. On second thought, worry about consistency, because you know it's really bad.

Let's get into the post.

~~~~~~~~~~~~

Prove that the square root of two is irrational.

What we're going to do here is assume that the opposite is true: Sqrt(2) is rational. By that logic, Sqrt(2) can be written as the fraction (a/b), where (a) and (b) are integers. Let's also assume that the fraction is simplified to its lowest terms. If it is, then both of them can't be even-- it could be simplified more.

If (a/b)=2, then (a^2/b^2)=2. Multiplying both sides by (b^2), you get (a^2)=2(b^2). Therefore (a) is even.

Because both (a) and (b) can't be even, then proving that (b) is even would prove that Sqrt(2) is irrational.

Since a is even, we can write (a) as (2*k), where k is half of a. Therefore:
(2k)^2=2(b^2)
4(k^2)=2(b^2)
2(k^2)=(b^2)

So b is even too which proves that Sqrt(2) is irrational.

~~~~~~~~~~~~

Prove that there are an infinite amount of prime numbers.

For this one, we're going to do the same thing- assume the opposite. There 'are' a finite amount of prime numbers.

If that's true, then we can multiply all of the prime numbers together to get some number c.

However, c+1 must be prime, because every prime number would have a remainder of 1 when dividing it. So that kind of proves it wrong, and it's a relatively easy proof.

~~~~~~~~~~~~~

Stay coolio,
John

Tuesday, September 9

Answers to the Diabolical Quiz

Did you get the answers? We'll see, I guess.

1. 144
2. 2
3. True
4. 2
5. False
6. 24
7. False
8. -12
9. True
10. -16

Believe me, there IS a way to solve this quiz. I just don't want to type it all.

Stay coolio,
John
~~~~~~~~~~~~~
PS- These are the answers to the quiz I posted last month. I'm really sorry that I haven't posted, but it's been a looooooooong couple of weeks for me. I will post tomorrow (or Thursday?), but I don't know. I have a lot of work to do, and I have to make this second on my list of priorities. But I promise I will post sometime this week. Thanks!

Monday, August 11

Diabolical Quiz About this Quiz

Time for another Problems w/John!!!!!!!!! You will hate me after this set.

1. What is the sum of all of the numerical answers of this quiz, including this one?
2. How many of these answers are "true"?
3. True or false: Question 1 has the highest numerical answer of this quiz.
4. How many answers are the same as this one, including this one?
5. True or false: All of the numerical answers are positive.
6. What is the average of all the numbers in this quiz, including this one?
7. True or false: The answer to Question 4 is greater than Question 2.
8. What is Question 1's answer divided by Question 8's?
9. True or false: The answer to question 6 is equal to the difference between answers 2 and 4, minus the product of answers 8 and 4.
10. What is the answer to this godforsaken question?

I'll put up answers on Wednesday.

Sorry I couldn't post last week, I was in Europe (land of the bad Internet). But honestly, not complaining.

Stay coolio,
John

Saturday, July 26

Hangman

Hey!

Imagine a man is convicted of murder and is sentenced to death one Saturday. The judge states that the man will be hanged sometime the next week, but the date will be a surprise-- the man won't know what day he is hanged until the noon of that day.

When the prisoner returns to his cell, he is ecstatic. Think about it: it can't be on a Saturday, because it is the last day of the week that he could be hanged on and therefore not a surprise. And if it was on Friday, he could be sure it was that day because Saturday has already been ruled out and therefore makes Friday the last possible day. So on and so forth until no day can he be hanged.

However, on Thursday, he is informed that he will be hanged. This comes as a complete surprise to him, contrary to his logic.

Consider this carefully. Is it a true paradox?

~~~~~~~~~~~~

Sorry for the short post. I'll put up an answer sometime next week, along with another post. Honestly, it's been a bit hard to do the blog, mainly because I get one hour every day to use my computer-- including free time, a research project that I have to do, and the blog.

I'll get you next week!

Stay coolio,
John

NEXT WEEK: Something Different

Friday, July 18

Ramsey Theory

Consider this problem:

Let's say that there are some people in a room for which some of them know each other and others do not. How many people must there be to make sure that either 3 of them are strangers to each other, or 3 have all met each other?

Another way to consider this problem is:

There are some points in a space, each connected by line segments to all of the other points. If each segment is either blue or red, then how many points must there be to ensure that there is one full triangle (with vertices on the points) outlined by all blue or all red?

In theory, these problems are exactly the same. The points are obviously people, and the color of the lines represents whether they know each other. If one color forms a triangle, three people either know each other or are total strangers to one another. Simple, right?


Anyway, the answer is 6 people. This is called the Ramsey number for two-colored triangles, written as:
R(3,3)=6

Let's call a complete graph (where all points are connected) with n points Kn. For Ramsey notation, the number of values in the parentheses represent the number of colors; the values themselves signify the graphs that we're trying to force. So R(3,6)=18 would be two colored, either forcing a red triangle or a blue K6.

Here are the Ramsey numbers that we know for now:
3, 3 = 6
3, 3, 3 = 17
3, 4 = 9
3, 5 = 14
4, 4 = 18
3, 6 = 18
3, 7 = 23
3, 8 = 28
3, 9 = 36
4, 5 = 25
6, 7 = 298

But then there are the irregular graphs, like straight lines and bowties and things like that. Well, thank you, Stefan Burr!

Sunday, July 13

Crafts Time (cont.)

Sorry, I just want to make a note on the last post I made, about the matchbox computer.

~~~~~~~~~~

Once upon a time, there was a guy named Donald Michie. When he was in WWII, he wanted to take Japanese and go fight on the Pacific front. Naturally, however, the class was full, and he did not sign up in time. However, he was not fazed in his war effort! He was recruited to help solve the enigmatic messages of the German army, and found that he was a natural in computer analysis. He began to work harder towards the study of artificial intelligence.

Within 20 years later, he invented the tic-tac-toe MENACE. MENACE was the Matchbox Educable Naughts And Crosses Engine, one of the first perfect-able robots to play the game of tic tac toe. He made the machine by diagramming all of the possible board states on 304 separate matchboxes. Although there are 19,683 possible board layouts*, Michie reduced this number to 304 by taking rotations, mirror images, and winning positions into account, thus reducing the number by over 98%.

*If you think about it, each of the 9 squares can be in one of three states: blank, X, or O. 3^9=19683.

~~~~~~~~~~~~

Stay coolio,
John