November 15, 2013

This link should take you to the YouTube channel of Algo-rythmics, or see their website.

Different sorting algorithms (bubble sort, insertion sort, quicksort, selection sort, shell sort) illustrated through folk dance.

187 – List of all presentations

January 10, 2012

For ease, I re-list here all the presentations we had throughout the term. I also include some of them. If you gave a presentation and would like your notes to be included, please email them to me and I’ll add them here.

  • Jeremy Elison, Wednesday, October 12: Georg Cantor and infinity.
  • Kevin Byrne, Wednesday, October 26: Alan Turing and Turing machines.
  • Keith Ward, Monday, November 7: Grigori Perelman and the Poincaré conjecture.
  • David Miller, Wednesday, November 16: Augustin Cauchy and Cauchy’s dispersion equation.
  • Taylor Mitchell, Friday, November 18: Lajos Pósa and Hamiltonian circuits.
  • Sheryl Tremble, Monday, November 28: Pythagoras and the Pythagorean theorem.
  • Blake Dietz, Wednesday, November 30: \mbox{\em Paul Erd\H os} and the Happy End problem.

Here are Jeremy’s notes on his presentation. Here is the Wikipedia page on Cantor, and a link to Cantor’s Attic, a wiki-style page discussing the different (set theoretic) notions of infinity.

Here are a link to the official page for the Alan Turing year, and the Wikipedia page on Turing. If you have heard of Conway’s Game of Life, you may enjoy the following video showing how to simulate a Turing machine within the Game of Life; the Droste effect it refers to is best explained in by H. Lenstra in a talk given at Princeton on April 3, 2007, and available here.

Here is a link to the Wikipedia page on Perelman, and the Clay Institute’s description of the Poincaré conjecture. In 2006, The New Yorker published an interesting article on the unfortunate “controversy” on the priority of Perelman’s proof.

Here are David’s slides on his presentation, and the Wikipedia page on Cauchy.

Here is a link to Ross Honsberger’s article on Pósa (including the result on Hamiltonian circuits that Taylor showed during her presentation).

Here are Sheryl’s slides on Pythagoras and his theorem. In case the gif file does not play, here is a separate copy:

The Pythagorean theorem has many proofs, even one discovered by President Garfield!

Finally, here is the Wikipedia page on \mbox{Erd\H os}. Oakland University has a nice page on him, including information on the \mbox{Erd\H os} number; see also the page maintained by Peter Komjáth, and an online depository of most of \mbox{Erd\H os's} papers.


187 – Presentations

November 14, 2011

David Miller will give a short presentation on Wednesday, November 16, on Augustin Cauchy and Cauchy’s dispersion equation.

Taylor Mitchell will give a presentation on Friday, November 18, on Lajos Pósa.

Sheryl Tremble will give a presentation on Monday, November 28, on Pythagoras and the Pythagorean theorem.

Blake Dietz will give a presentation on Wednesday, November 30, on \mbox{\em Paul Erd\H os}.

187 – An exploration

November 7, 2011

Problem 6 in the midterm asked to prove that if n is an integer and n^2 is a multiple of 3, then n is already a multiple of 3.

As we now know from lecture, the key seems to be that 3 is a prime number. For example, it is not necessarily the case that if n^2 is a multiple of 4, then n is a multiple of 4. For a counterexample, we can take n=2.

The proof I was expecting was by contrapositive: If n is not a multiple of 3, then it has a non-zero remainder when divided by 3, so n=3k+1 or n=3k+2 for some integer k. This means that n^2=9k^2+6k+1 or n^2=9k^2+12k+4. After some rearranging, we see that in both cases we have n^2=3t+1 for some integer t, but then n^2 is not a multiple of 3 after all.

Using Euclid’s lemma, we can give another proof that is particularly short: Since 3 is a prime, then whenever 3 divides a product, it divides one of the factors. We are told that 3 divides n^2=n\cdot n, so it divides n or it divides n. On the other hand, this brevity is only apparent, as the proof uses Euclid’s lemma, which makes use of the Euclidean algorithm and the possibility of writing the GCD of two numbers as a linear combination of them. When written in full detail, this argument ends up being longer than the one we gave first.

A different approach was suggested during lecture, and I think it leads to a nice argument, so I am presenting it here.

Read the rest of this entry »

187 – Presentation

November 7, 2011

Keith Ward will give a short presentation on Monday, November 7, on Grigori Perelman and the Poincaré conjecture.

187 – Some extra credit problems

November 7, 2011

I have extended the deadline for extra credit problems: They are now due at the beginning of the final exam. In addition to the previous problems, I will be adding a few more through the next few days in this post.

  • The problem at the end of the second midterm. Specifically, find (with proof) the correct formula for the resulting number of regions, when n points are positioned on the circumference of a circle, and all possible lines between them are drawn. This problem is due to Leo Moser and is discussed in a few places, for example, in Mathematical Circus, by Martin Gardner.
  • Given n+1 numbers from \{1,2,\dots,2n\}, show that there must be two such that one divides the other. This problem can be solved using mathematical induction, but feel free to solve it by other methods.
  • Solve this self-referential test.

187 – Timothy Gowers

November 2, 2011

Professor Gowers is a British mathematician, Fields medalist 1998. Besides his many interesting and significant results, Gowers has contributed to the mathematical community in several other valuable ways, for example, by prompting the creation and development of polymath projects, “massively collaborative mathematics“.

His blog is very interesting. Recently, he has been posting on topics that are quite close to the content of our course, starting with his Welcome to the Cambridge Mathematical Tripos. I recommend that you take a look at his recent postings (and their comments), as one of Gowers’s strengths is his clarity of exposition helping one understand how even complicated results can be naturally motivated and proved.

Here is a link to a lecture he gave at the Millennium Meeting on May 2000, On the importance of mathematics, also highly recommended. The lecture is split into a series of short videos and lasts about one hour. I hope you can find the time to watch it on its entirety. Here is a pdf transcript of the talk.

Here is the list of his recent postings on topics relevant to our course:

The subject of his next few postings will be one of our coming topics, and they all certainly come up in more advanced courses, so it may be useful to read these as well:

187 – Selected solutions from Chapter 3

November 2, 2011

Professor Warren Esty, has made available a list of partial solutions to some of the problems from Chapter 3. As before, please let him (or me) know if you find errors or typos, or if you have suggestions for alternative solutions or different approaches. Unfortunately, it is my understanding that no solutions will be provided for later chapters.

Solutions (Chapter 3)

Also, Joanna Thompson, our reader, has supplied solutions for last week’s homework.

187 – Mathematics – Stack Exchange

October 22, 2011

I have mentioned a few times the website and suggested that you take a look at it and use it as a resource. I believe it is a really useful site when used appropriately. Some of you have asked for additional references, and I think this site may help supply some of them.

Here is a short list of questions posted on the site that may give you an idea of its value:

187 – Presentation

October 21, 2011

Kevin Byrne will give a short presentation on Wednesday, October 26, on Alan Turing and Turing machines. Here is a link to the official page of the Alan Turing Year.