Minecraft for Dummies, written by a 15 year old Metroplex Math Circle student is now the #1 Best Seller in Game Programing at Amazon.com.
This Saturday, April 20th Dr. Kisačanin will return for another of his fantastic lectures. Triangles factor into almost every math contest in addition to being endlessly fascinating objects in themselves. Here is Dr. Kisačanin’s description of the session with links to resources:
In this talk about geometry of triangles we will see two different proofs of Stewart’s theorem, derive formulas for important cevians, and solve several interesting geometric problems.
We will also look at other important points in triangles (Fermat point, centers of excircles, …) and look at the Euler line, the nine-point circle, and related problems.
I haven't even started writing yet and a lot of you probably already have several questions, so I'll try to make this article a bit smoother by answering those first.
1. What the heck is a Minecraft?
Minecraft is an extremely popular 'sandbox' or open world game, developed starting in 2010 by a small company in Sweden called Mojang. The game quickly grew to a massive player base, with new content being released constantly in the form of free updates.
North Texas and Metroplex Math Circle participants were well represented in both the team and individual results at this year’s Texas State MATHCOUNTS competition. Congratulations to all of the participants.
Posted in Competitions | Tagged Brian Du, Fermat School for Math and Science, Hendrick Middle School, Hockaday, Jeffrey Huang, Kaden Han, Kevin Choi, Max Bu, Michael Ma, Renner Middle School, Rice Middle School, Schimelpfenig Middle School, St. Mark's School of Texas, Vinjai Vale | 1 Comment »
For 2ⁿ – 1 to be prime we also need n itself to be prime, but that is not sufficient. For example, 2¹¹ – 1 is composite even though 11 is prime. However, if you look at tables of Mersenne primes it is interesting to note that if you start with 2 and use that to make a new number 2ⁿ – 1 with n = 2 you get 3, then recycling the 3 you get 7, use n = 7 and you get 127, another prime! How long could this go on?
Let f(n) = 2ⁿ – 1. The iterations you get, starting from 2, are f⁰(2) = 2, f¹(2) = 3, f²(2) = 7, f³(2) = 127, f⁴(2) = 1701411834604692317316873037158884105727.
None, that is, until Euler combined his genius with an impish disbelief in Fermat’s conjecture to discover that g⁵(2) = 4294967297 = 641 * 6700417. And since then we have found many more composite Fermat numbers, and no further Fermat primes, leading to the complementary conjecture that all the rest are composite! It seems that we never learn to be humble around these things…
It takes a larger number to be “forever beyond reach” these days. Rather than the now puny 4294967297 we cower before f⁵(2) = 2¹⁷⁰¹⁴¹¹⁸³⁴⁶⁰⁴⁶⁹²³¹⁷³¹⁶⁸⁷³⁰³⁷¹⁵⁸⁸⁸⁴⁴¹⁰⁵⁷²⁷ – 1, and who can blame us?
Join us in the first hour to hear MMC students present some of their favorite problems and mathematical concepts. In the second hour we will work on problems from the Purple Comet! contest and talk about this exciting opportunity to compete with other students around the world.