Some questions to explore:
- It has been suggested earlier that the set of prime numbers is infinite. Primes are a subset of integers.
- Integers are a subset of Rationals, which are a subset of Reals, and then on to Complex and beyond.
- If the integers are infinite, and if the real numbers are infinite, are there the same number of both?
- What about rational numbers? What about irrational numbers? Are those two sets equal in size?
- What is an algebraic number? What is a transcendental number? How large are those sets?
- Are all of these infinities equal? How many infinities are there? Who thought all of this up? Are there any other approaches?
A few hints to start with, from Wikipedia:
In mathematics, a transcendental number is a real or complex number that is not algebraic—that is, it is not a root of a nonzero polynomial equation with integer (or, equivalently, rational) coefficients. The best-known transcendental numbers are π and e. Though only a few classes of transcendental numbers are known (in part because it can be extremely difficult to show that a given number is transcendental), transcendental numbers are not rare. Indeed, almost all real and complex numbers are transcendental, since the algebraic numbers are countable while the sets of real and complex numbers are both uncountable. All real transcendental numbers are irrational, since all rational numbers are algebraic. The converse is not true: not all irrational numbers are transcendental; e.g., the square root of 2 is irrational but not a transcendental number, since it is a solution of the polynomial equation x2 − 2 = 0. Another irrational number that is not transcendental is the golden ratio, φ or ϕ, since it is a solution of the polynomial equation x2 − x − 1 = 0.
The Fibonacci sequence is the sequence defined by:
First 15 sequence values:
is called the Golden Ratio. It satisfies the property
Can you show that the sequence of ratio of successive Fibonacci numbers
converges to the Golden Ratio?
is already pretty close to φ.
What conditions must be met for this ratio to converge?
Extension: Missing Squares
An elegant variation of this idea makes use of two rectangles of such proportion that they fit side by side to make a perfect 8 by 8 checkerboard. When the pieces are rearranged to make the larger rectangle, there is an apparent gain in area of one square unit. Where did the extra square come from, and what does this have to do with Fibonacci?
Pythagorean triples are sets of three integers that are solutions to the associated identity for right triangles.
The question is this:
Can you find a formula or algorithm for generating Pythagorean Triples?
There may be more than one formula, and each might not be exhaustive. All we are after is a set of rules such that, given one number, can you find the other two that belong to the triplet?
An after-camp bonus show for anyone interested:
More Info Here
Euclid’s second theorem is simply stated:
The number of primes is infinite.
Can you show this to be true?
Bonus: Can you prove it without using a contradiction?
Game Theory, as described on Wikipedia, is:
the study of mathematical models of conflict and cooperation between intelligent rational decision-makers.
A classic example is the Prisoner’s Dilemma:
Two members of a criminal gang are arrested and imprisoned. Each prisoner is in solitary confinement with no means of communicating with the other. The prosecutors lack sufficient evidence to convict the pair on the principal charge, but they have enough to convict both on a lesser charge. Simultaneously, the prosecutors offer each prisoner a bargain. Each prisoner is given the opportunity either to betray the other by testifying that the other committed the crime, or to cooperate with the other by remaining silent. The offer is:
- If A and B each betray the other, each of them serves two years in prison
- If A betrays B but B remains silent, A will be set free and B will serve three years in prison (and vice versa)
- If A and B both remain silent, both of them will only serve one year in prison (on the lesser charge).
This one is rather easy to pose, and can be difficult to solve, even with a proof sitting right in front of you. The result is a bit surprising as well, and gives some insight into the structure of the integers and prime numbers.
Given two random integers, what is the probability that they have no common factors besides 1?
or, how it is usually posed:
What is the probability of two random integers being coprime?
Where “coprime” means “the greatest common divisor is one”.
There is an island with 100 women. 50 of the women have red dots on their foreheads, and the other 50 women have blue dots on their foreheads.
If a woman ever learns the color of the dot on her forehead, she must permanently leave the island in the middle of that night.
One day, an oracle appears and says “at least one woman has a blue dot on her forehead.” The woman all know that the oracle speaks the truth.
All the woman are perfect logicians (and know that the others are pefect logicians too). What happens next?
Three Masters of Logic wanted to find out who was the wisest amongst them. So they turned to their Grand Master, asking to resolve their dispute. “Easy,” the old sage said. “I will blindfold you and paint either red, or blue dot on each man’s forehead. When I take your blindfolds off, if you see at least one red dot, raise your hand. The one, who guesses the color of the dot on his forehead first, wins.” And so it was said, and so it was done. The Grand Master blindfolded the three contestants and painted red dots on every one. When he took their blindfolds off, all three men raised their hands as the rules required, and sat in silence pondering. Finally, one of them said: “I have a red dot on my forehead.”
How did he guess?
Step 1: Use long division (no calculators please!) to convert the fractions (in this case, specifically reciprocal integers) to decimal representations.
Step 2: Look at the results. What do you notice? Write down all the questions that come up.
Step 3: As a group, we will make a list of all the questions.
Step 4: Think and write up your answers to the questions.
Step 5: Discuss!
Note: Work with a partner to divide up the work in Stages 1, 2, and 4.
1/2 = __________ 1/11 = __________
1/3 = __________ 1/12 = __________
1/4 = __________ 1/13 = __________
1/5 = __________ 1/14 = __________
1/6 = __________ 1/15 = __________
1/7 = __________ 1/16 = __________
1/8 = __________ 1/17 = __________
1/9 = __________ 1/18 = __________
1/10 = __________ 1/19 = __________
1/20 = __________
There are 5 rational pirates (in strict order of seniority A, B, C, D and E) who found 100 gold coins. They must decide how to distribute them.
The pirate world’s rules of distribution say that the most senior pirate first proposes a plan of distribution. The pirates, including the proposer, then vote on whether to accept this distribution. If the majority accepts the plan, the coins are dispersed and the game ends. In case of a tie vote, the proposer has the casting vote. If the majority rejects the plan, the proposer is thrown overboard from the pirate ship and dies, and the next most senior pirate makes a new proposal to begin the system again. The process repeats until a plan is accepted or if there is one pirate left.
Pirates base their decisions on four factors:
- First of all, each pirate wants to survive.
- Second, given survival, each pirate wants to maximize the number of gold coins he receives.
- Third, each pirate would prefer to throw another overboard, if all other results would otherwise be equal.
- And finally, the pirates do not trust each other, and will neither make nor honor any promises between pirates apart from a proposed distribution plan that gives a whole number of gold coins to each pirate.
Extension: Keep everything above the same, except change it to 500 pirates rather than 5. Can the same strategy be applied?
Adapted from Parade magazine, April 15th, 1990:
There are 1,000 tenants and 1,000 apartments. The first tenant opens every door. The second closes every other door. The third tenant goes to every third door, closing it if it is open and opening it if it is closed. The fourth tenant goes to every third door, closing it if it is open and opening it if it is closed. This continues with every tenant until the 1,000th tenant opens the 1,000th door. Which doors are open?
Bonus question: Can you be sure ahead of time that the 1,000th tenant closes the 1,000th door rather than opens it? How can you be sure?
Another problem from Parade (same column, same year) about doors:
Suppose you’re on a game show, and you’re given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what’s behind the doors, opens another door, say No. 3, which has a goat. He then says to you, “Do you want to pick door No. 2?” Is it to your advantage to switch your choice?
- Transcendental Numbers
- Hat/Dot logic puzzles
- Mathematics of Paradoxes
- Squaring the Circle
- Geometric Constructions
- Machine Learning
- Gabriel’s Horn
- Banach-Tarski Paradox
- Shor’s Algorithm
- Additional Topics
- Types of Numbers: Frobenius, McNugget, Versatile, etc.
- Cassini’s Identity
…stay tuned for more, with links and details.