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
JOHN Join Coin Corn Core Coke Coke Cake Make Mate MATH Moth Mott Moot Coot Clot Clog BLOG Clog Clon Coon Coin Join JOHN
Saturday, July 26
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!
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
~~~~~~~~~~
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
Tuesday, July 8
Crafts Time
IT'S FUN DAY MONDAY OMG SO EXCITED!!!!!!!
So I've been at the beach for 4 days now, and that of course means a lot of reading for those less inclined to enter the water. And so I learned something new:
~~~~~~~~~
How to Make a Hexapawn Educable Robot (HER)
Materials:
1) 24 Matchboxes or Similar Containers (Preferably blank)
2) 3-4 Bags of M&Ms
3) Paper
4) 4 Colored Sharpies (Orange, Blue, Green, Red, Brown, and/or Yellow)
5) 3 Pennies (or other coins)
6) 3 Dimes (or other coins)
Procedure:
1) Copy these diagrams onto the matchboxes:
2) On each of the diagrams, color all the arrows in each diagram differently.
3) Open the bags of M&Ms and sort them by color.
4) Eat the two colors of M&Ms whose corresponding Sharpie you do not have. For example, if you don't have a yellow or brown Sharpie, eat all the yellow and brown M&Ms.
5) Put an M&M in each box for the number and color of the arrows on it. For example, if there is a
red arrow on the box, put in a red M&M.
6) Draw a three-by-three grid and put the coins on opposite sides, like so:
You are now ready to face your computer in Hexapawn!
~~~~~~~~~~
How to Play Hexapawn:
Hexapawn is a one on one game that you play against HER in order to teach it how to win! To win, you must either:
1) Capture all of your opponent's pawns,
2) Get one of your pawns to the opposite side, or
3) Be the last player to be able to move.
Your pawns move the same way that they would in chess-- they can only move forward, except they must capture diagonally-- except there are no double moves and en-passants. Good luck!
~~~~~~~~~~
How to Operate your HER:
First, arrange the matchboxes as shown in the diagram above. This makes the game run smoother.
Then you can start the game. You make your move first.
Here's how you operate the robot:
1) Find the matchbox whose diagram is either the same as the current board position or a mirror image.
2) Shake the matchbox to mix the M&Ms.
3) With your eyes closed, open the matchbox and pick a random M&M.
4) Place the M&M on top of the matchbox and observe the color of the M&M.
5) Find the corresponding arrow for the color of the M&M.
6) Make the move as indicated by the arrow.
3.5*) If there are no M&Ms in the box, the robot automatically loses.
The education of the robot is based on a reward/punishment system. When the robot wins the game, the M&Ms that are on top of the boxes are placed back inside. When it loses, take away the M&M that represents the last move that the robot made; *if a box is empty, the HER loses and you take away the M&M on last move's box.
~~~~~~~~~~
How the HER Works
Imagine a huge probability tree that represents the outcomes of each game. Each splitting of branches represents the robot's decision-- and so the end of a branch is either a win or a loss for the robot. When you remove M&Ms, you are, in essence, cutting off the branches in which the robot loses. The robot has a big advantage by going second, and so it will eventually have the ability to win every game it plays.
~~~~~~~~~~~
Stay coolio,
John
NEXT WEEK: Ramsey Numbers
Tuesday, July 1
Hailstones (The Collatz Conjecture)
Hey guys, I'm back from camp with a TON of new ideas. I got a bunch of math books as a graduation present (which would be a really mean present if I wasn't myself), and I got some new topics to discuss.
~~~~~~~~~~
In the science of the hydrosphere, we all know that water molecules present in air all eventually return to the Earth in the form of precipitation. One of the forms thereof is hail, which forms in heavy storms when liquid rain freezes onto snow pellets and begins to form solid lumps.
Let's say that layers of the atmosphere are marked by numbers, starting with one as the ground. The goal of a hailstone is, obviously to reach one.
The process that determines the path of a hailstone is this:
1) If a hailstone reaches level n, and n is odd, then the hailstone is caught by a gust of wind and shoots up to level 3n+1.
2) If n is even, then there is no wind and the hailstone falls to n/2.
3) This process is continued upon itself until n reaches 1.
For any positive integer from which the hailstone (n) begins, does n reach 1?
This can also be stated as:
~~~~~~~~~~
~~~~~~~~~~
In the science of the hydrosphere, we all know that water molecules present in air all eventually return to the Earth in the form of precipitation. One of the forms thereof is hail, which forms in heavy storms when liquid rain freezes onto snow pellets and begins to form solid lumps.
Let's say that layers of the atmosphere are marked by numbers, starting with one as the ground. The goal of a hailstone is, obviously to reach one.
The process that determines the path of a hailstone is this:
1) If a hailstone reaches level n, and n is odd, then the hailstone is caught by a gust of wind and shoots up to level 3n+1.
2) If n is even, then there is no wind and the hailstone falls to n/2.
3) This process is continued upon itself until n reaches 1.
For any positive integer from which the hailstone (n) begins, does n reach 1?
This can also be stated as:
~~~~~~~~~~
FACTS:
1. The sequence always ends [...] 16, 8, 4, 2, 1.
2. The conjecture has been proved up to about 5476377146882523136.
3. The sequence always returns to one if n is a power of 2.
4. The recurrence is undecidable (it cannot be solved by an algorithm).
5. Once the hailstone reaches 16, the hailstone is set into an infinite loop around (4,2,1).
6. Most diagrams are created in reverse.
Up to 20 iterations. Ends with one in the center.
~~~~~~~~~~~~~
Hey guys! It's good to be back. From now on, I'm going to try to have one post every Monday. I have so much to talk about, but I don't want to waste all of my ideas now! We'll see what happens later, I guess.
Stay coolio,
John
NEXT WEEK: More on Game Theory
Thursday, May 29
Illustrated Multiplication! (AKA Educational Satire)
Ever had trouble multiplying fast? Do you just want to doodle in math class? We can help you!
Try out our new product, Illustrated Math! It's easy as 'pi' and we'd LOVE to give it to you for free!
Here's a song to celebrate your discovery of this easy new trick!
How unnecessary was that?! But as an infomercial, we need some cheesy background music!
It's EASY!
Let's do a demo!
Let's multiply 51 and 23. First, we draw lines representing digits.
Great! Now let's separate the columns and count up the number of intersections in each column!
Fantastic! All we have to do is add it up!
+ 3
+ 1 7
+ 1 0
= 1 1 7 3
Let's check to see if our answer is correct!
Wow! Shazam! Fantabulous!
It's FAST!
Studies show that this new, cool multiplication trick can save you –50% time when compared against regular multiplying! This is mainly because some idiot wrote the answer on the paper during the first of the regular trials and we didn't bother to replace it!
It's CHEAP!
Even though this is more of a concept than a product, we can give it to you for free!* (This doesn't include the $19.99 shipping and handling, the complimentary $199.99 gift pack we'll send you, or the medical bill you'll need to pay after using this product! Don't read the subtext!)
It WORKS!
By the FOIL method straight from middle school algebra! We can't believe you didn't figure this out yourselves, you disgraces to all humanity! (Even though we didn't figure it out either. Shh, don't tell)
And it's probably harmless!
The 2% of subjects that survived reported that it had really changed their lives for better or worse! You don't want to know which!
CALL 1-800-I-SEE-U-PN to order NOW!
Make checks payable to Bad Products Inc. ©.
*Batteries, Medical Consultation, and Michael Jackson not included.
The more common and l side effects may include Stockholm Syndrome, Bruce Jenner approximation syndrome, organ inversion, and zombification. At the risk of getting sued we can't tell you the nastier ones or you wouldn't buy this product.
~~~~~~~~~~
Hey everybody! I'm BACK! Sorry for not posting-- I've had a nice little month of studying for exams. I actually finished a post two weeks ago and, of course, the school server was shut down and it didn't work. I'm going to post that next week to make up for a), my long absence from your world, and b), the nastiness of this post.
Sorry for not posting earlier, but April Showers bring the overpowering stench of May exams!
Stay coolio,
John
IMPORTANT NOTE- Tragically, I'm not going to be able to post very much this summer, because it's summer. I promise I'll get back to you in late June or early July!
~~~~~~~~~~
Hey everybody! I'm BACK! Sorry for not posting-- I've had a nice little month of studying for exams. I actually finished a post two weeks ago and, of course, the school server was shut down and it didn't work. I'm going to post that next week to make up for a), my long absence from your world, and b), the nastiness of this post.
Sorry for not posting earlier, but April Showers bring the overpowering stench of May exams!
Stay coolio,
John
IMPORTANT NOTE- Tragically, I'm not going to be able to post very much this summer, because it's summer. I promise I'll get back to you in late June or early July!
Wednesday, May 7
Probs of the Week v. 3.0
Yep. It's back.
1. Based on the following facts:
ab=1
b+c=0
b+c+d=0
bc=-9
c+a<d
What is a+b?
2. The first term of a geometric sequence is 12. If the geometric mean of the first 3 terms is 18, what's the third?
3. If three competing products have loyalties of 20%, 60%, and 80%, and half of the customers that switch go to one of the other products, then how many customers will go to each after they begin marketing regularly?
4. How many distinct integers are in the set of differences between numbers of the set, {1,3,5,7,9,10, 11,13}?
5. How much wood could a woodchuck chuck if a woodchuck could chuck wood?
~~~~~~~~~~~~~
1. Let's gather our info:
a) a is the reciprocal of b, and the negative reciprocal of c
b) b is equal to negative c, and their product is -9
c) d is equal to 0, and is greater than the sum of a and c.
We can draw the conclusion that:
d) b and c are equal to 3 and -3, in some order
e) a is equal to either -1/3 or 1/3
f) a+c=-3+(1/3)<0
g) a=1/3, b=3, c=-3
h) a+b=3+(1/3)=10/3
2. By definition, the geometric mean is the second term. The ratio of 18 to 12 is 3/2; 3/2 times 18 is 27.
3. The matrix is...
[ 0.2 0.4 0.4]
[ 0.2 0.6 0.2]
[ 0.1 0.1 0.8]
To the power of 30 it reaches
[ 0.1429 0.2857 0.5714]
[ 0.1429 0.2857 0.5714]
[ 0.1429 0.2857 0.5714]
4. Let's remove the 10 for now. The differences between the numbers are the even integers from 2 to 12-- that makes 6. Now, the 10 is different- the difference between it and the other numbers is always odd, from one to nine. Six plus five, if you couldn't figure out, is 11.
5. Enough to spray splinters into your tongue... who really cares? According to a website I found, the answer is 22 cubic inches. That's more of a biology problem anyway.
So YEAH!
Bye sweet children!
John
PS: We're learning about conditionals and logic problems in class today, and it's taking absurdly long for some of my friends to figure it out. Oh, sweet rationale... where have you run off to now?
1. Based on the following facts:
ab=1
b+c=0
b+c+d=0
bc=-9
c+a<d
What is a+b?
2. The first term of a geometric sequence is 12. If the geometric mean of the first 3 terms is 18, what's the third?
3. If three competing products have loyalties of 20%, 60%, and 80%, and half of the customers that switch go to one of the other products, then how many customers will go to each after they begin marketing regularly?
4. How many distinct integers are in the set of differences between numbers of the set, {1,3,5,7,9,10, 11,13}?
5. How much wood could a woodchuck chuck if a woodchuck could chuck wood?
~~~~~~~~~~~~~
1. Let's gather our info:
a) a is the reciprocal of b, and the negative reciprocal of c
b) b is equal to negative c, and their product is -9
c) d is equal to 0, and is greater than the sum of a and c.
We can draw the conclusion that:
d) b and c are equal to 3 and -3, in some order
e) a is equal to either -1/3 or 1/3
f) a+c=-3+(1/3)<0
g) a=1/3, b=3, c=-3
h) a+b=3+(1/3)=10/3
2. By definition, the geometric mean is the second term. The ratio of 18 to 12 is 3/2; 3/2 times 18 is 27.
3. The matrix is...
[ 0.2 0.4 0.4]
[ 0.2 0.6 0.2]
[ 0.1 0.1 0.8]
To the power of 30 it reaches
[ 0.1429 0.2857 0.5714]
[ 0.1429 0.2857 0.5714]
[ 0.1429 0.2857 0.5714]
4. Let's remove the 10 for now. The differences between the numbers are the even integers from 2 to 12-- that makes 6. Now, the 10 is different- the difference between it and the other numbers is always odd, from one to nine. Six plus five, if you couldn't figure out, is 11.
5. Enough to spray splinters into your tongue... who really cares? According to a website I found, the answer is 22 cubic inches. That's more of a biology problem anyway.
So YEAH!
Bye sweet children!
John
PS: We're learning about conditionals and logic problems in class today, and it's taking absurdly long for some of my friends to figure it out. Oh, sweet rationale... where have you run off to now?
Subscribe to:
Posts (Atom)


