Please join us for another exciting math circle where we are pleased to welcome Dr. Imre Leader.  Dr. Leader is a professor of Pure Mathematics at the University of Cambridge, an IMO medalist, and a 10 times national champion of Othello!

He will give a presentation this Saturday on Van Der Waerden’s Theorem which “is a theorem in the branch of mathematics called Ramsey theory. Van der Waerden’s theorem states that for any given positive integers r and k, there is some number N such that if the integers {1, 2, …, N} are colored, each with one of r different colors, then there are at least k integers in arithmetic progression all of the same color. The least such N is the Van der Waerden number W(rk). It is named after the Dutch mathematician B. L. van der Waerden.[1]

Here is a question to get you thinking, “Suppose that we are given a long string of beads. The beads come in two colors, red or blue, but there may be no `pattern’ to the sequence of colors. Can we guarantee to find three equally-spaced beads of the same color? For example, if the 4th, 6th and 8th beads were blue then this would count.”

This topic will be accessible for even young students as long as they understand power notation, e.g. 3^10.

REMINDER:  We are meeting in room 2.312 of the ECSS building


(Image credit: Wikipedia)

Come join us in learning about  number sequences! We will start with a story about Leonardo Pisano, better known as Fibonacci, his often forgotten fundamental contributions to mathematics (do you know what they are?), and his ubiquitous sequence of Fibonacci numbers: 1, 1, 2, 3, 5, 8, 13, 21, 34, …

We will also learn about other important sequences, such as perfect numbers, Mersenne primes, Fermat primes, and see how they are often related to each other in sometimes unexpected ways. They even make surprising appearances in other mathematical disciplines, for example Fermat primes play a key role in what Gauss discovered about construction of regular polygons.
If this sounds interesting, then this lecture is for you, regardless of your grade level. Parents are welcome too and everybody can ask questions! In our audience we mostly see students from grades 6-12, but it is not rare to see much younger aspiring mathematicians and scientists, including future winners of ISEF and other major competitions!
To hear about all that and much more, come join us at this free, no-registration-needed, event at UTD, on Saturday, Sept. 20, 2014, 2-4 PM, in the ECSS building, room 2.312 (note, this is a different room) For more information about how to find us, please see: http://metroplexmathcircle.wordpress.com/about/directions-and-times/
Our speaker, Dr. Branislav Kisačanin, is a frequent speaker at the Metroplex Math Circle and a faculty member at the AwesomeMath Summer Camps and at the new AwesomeMath Academy. He is also involved in science fair competitions at all levels, school to ISEF. He is a practicing computer scientist with great interest in teaching and writing about math, physics, and computer science.

Please join us for this kick off event for Math Circle!  Naoki Sato will give an enlightening talk about Game Theory as described below:


When playing a two-player game, what is the best move? What is the best overall strategy? And is there a way to determine who can win? In this talk, we will be exploring the basics of combinatorial game theory, starting with simple two-player games, such as Nim. Along the way, we will see how we can determine winning positions, and we will give techniques for analyzing other types of games.

Metroplex Math Circle:

A story that contrasts with the spirit of math circles (where we fix kids).

Originally posted on powersfulmath:

I am Desperate

I am on a desperate search to find out who or what broke my students.  In fact I am so desperate that I stopped class today to ask them who broke them.  Was it their parents, a former teacher, society, our education system or me that took away their inquisitive nature and made math only about getting a right answer?  I have known this was a problem for a while but today was the last straw.  

A Probability Lesson Gone Wrong

It started out innocently enough working on the seventh grade Common Core standard 7.SP.C.5 about understanding that all probabilities occur between zero and one and differentiating between likely and unlikely events which I thought would be simple enough. After the introduction and class discussion we began partner work on this activity from the Georgia Common Core Resource Document (see page 9).  The basic premise of…

View original 763 more words

Thank you, MMC families and presenters, for a wonderful Spring session of Math Circle.   Have a great summer.



eigenvaluesA dynamical system is a set of functions that depend on each other. For example, dynamical systems are often present in ecosystems: more plants mean more plant-eaters, and more plant-eaters mean fewer plants. These systems can be difficult to predict, as one thing affects another, which affects the first, which affects the other, and so on.

Fortunately, dynamical systems can be simplified. This lecture focuses on an important type of dynamical system that can be solved with some creative usage of matrices. We’ll also discuss the related concept of “eigenvalues,” a simple concept with some very interesting implications.

Please join us for the last math circle of the Spring Semester!

PascalsTriangleCoefficientThe first hour of this talk will be targeted primarily at the younger part of our audience (roughly in grades 4-7) – we will explain the fundamental rules of counting that can be used to solve even very hard problems: rule of sum (addition principle), rule of product (multiplication principle), pigeonhole principle, and the inclusion-exclusion principle. We will use them to solve a number of interesting problems from various competitions. For those students already familiar with these concepts, we will have a set of problems to keep them busy during the first hour.

The second hour will be targeted at the more experienced members of the Math Circle community (roughly grades 8-12). First, we will discuss several techniques used to prove combinatorial identities (combinatorial arguments, algebraic manipulations, and the method of generating functions). We will prove several important combinatorial identities using all of these techniques, illustrating the diversity of approaches found in combinatorics. After that we will look at applications of combinatorics in number theory, geometry, and graph theory, illustrating them with more interesting and challenging problems. While the younger part of our audience may not be able to follow everything during the second hour, it will be a great exposure to advanced mathematical topics, to show them they have a lot more to learn.

Throughout the talk we will highlight the mathematicians who developed this beautiful mathematical field, from its beginnings in gambling to modern applications in medicine, science, and technology.



Get every new post delivered to your Inbox.

Join 128 other followers

%d bloggers like this: