Saturday, April 26, 2008

Circular Puzzle

Puzzles of various sorts have been popular on the math blogosphere lately, so I thought I'd make my own modest contribution. As puzzles go, there is not very much to this one -- no calculations are necessary, you can just look at it and visualize the answer. But the backstory that goes with it is mildly amusing. This appeared as a question on the SAT exam, back many years ago when I was an undergrad.

Imagine a circle of radius 1 unit, sitting on top of a larger circle of radius 3 units, like so: Now suppose that the smaller circle rolls around the perimeter of the larger circle until it returns to its starting position. In the course of doing this, how many rotations about its axis will the smaller circle make?

Before going on, you might want to take a moment to think about what the answer should be... Okay, ready? This particular problem was featured in a story in the news because the answer key used to score the SAT had the wrong value for this question. Let's just call it x for the time being. A high school student who sat for the exam realized that the correct answer should be y, and the math scores had to be retabulated for everyone who took the SAT that session.

The story appeared in our local paper over the weekend. The following Monday, the professor for my differential equations class, who also happened to be serving as the department chairperson that semester, mentioned that he had received a phone call from a newspaper reporter asking about the question. The professor sketched out the problem for us, and said, "I told him that, of course the answer was x." Naturally as soon as class was over, several of us students who had read about the problem over the weekend ran up to the professor and explained to him why he was wrong.

For the next week, the problem continued to stir up debate in our math lab. About half the students who looked at it initially believed the answer was x. Most people quickly changed their minds once it was explained to them, but we did have one hold-out who refused to budge. If I remember correctly, he was a Ph.D. candidate in differential geometry, who insisted that since he had advanced training in a geometrical field, we should defer to his judgment on the problem.

(Now, as to what x and y are... You have almost certainly figured out the correct values for those by now. If you are still unsure, though, I'll put a hint in the comments for you.)

Labels:

Monday, October 01, 2007

SocialRank (and MathBloggers) is now live

A few weeks ago I wrote a post about SocialRank, which seems to be a new blog search engine that identifies which blogs entries are currently generating a lot of interest. These entries are categorized by subject matter and daily 'top 15' lists are created for the top blogs and top blog entries. The result for each category appears under its own domain name, and for math blogs the end product is MathBloggers.

At the time I last wrote about this, the SocialRank sites were all password protected while under development, but an anonymous commenter has pointed out that as of today SocialRank is now live. The first 30 blog categories are now open, and this includes MathBloggers.

So how good of a job did MathBloggers do on its first outing? Well, in addition to several blog entries that I had already read and might expect to see on a 'top 15' list, there were several entries (and blogs) listed that I was not familiar with. So MathBloggers succeeded in broadening my reading. The MathBloggers list also included a nice mix of pure math, math ed, mathematical physics, and theoretical computer science blogs. The blog Good Math, Bad Math, while being a very good blog, seemed to be over-represented on the list, so SocialRank may need to fine-tune their ranking system to keep very popular blogs from overwhelming the little ones. There was also one noticeable bug: blog URLs only contained the actual domain name and not any path info. As a result, Good Math, Bad Math shows up as ScienceBlogs, for example, and Jacques Distler's Musings appears simply as the host server name Golem. (This problem did not affect the URLs for individual blog entries, only for the blog home URLs.)

Overall, it seems like an interesting effort, and I'm going to keep checking MathBloggers on a regular basis to see how it develops.

Update

Hmmm, maybe I spoke a little too soon on this. There is definitely something a little "off" about the Top Blog Posts list. A couple of entries currently listed there are from Skrentablog, which is a tech blog with practically no math content. The other blogs represented on the list seemed to fit the category better, but some of the particular entries seemed like peculiar choices. Vlorbik wonders how his own blog got so highly rated. His particular entry that made the list was about the Excel number formatting error that was a big news item last week; maybe the overall blogosphere interest in the story somehow rubbed off indirectly on his post. In any event, the SocialRank ranking algorithm seems to be doing some weird things. It will be interesting to see how well it tracks blog interest later this week when the next Carnival of Mathematics comes out.

Labels: ,

Saturday, September 08, 2007

Carnival of Mathematics XVI

Welcome to the 16th Carnival of Mathematics, the comments and opinions edition. The host of the previous edition of the carnival set up some pretty high expectations, what with providing both interesting background information on the fortnight's posts, and pretty pictures to accompany them. We'll be having none of that here. No, this is the blogosphere we're talking about, and even if the subject matter is the noble quest for mathematical knowledge, our stock and trade are comments and opinions. That high bar actually has me thinking "limbo", and I want to see just how low I can go. So without further ado, here are this edition's entries.

The Good

I have nothing but admiration for the good souls who struggle day after day with teaching our children, so we begin our list with the mathematical educators...

Starting us off is Denise at Let's play math!, who gets us in the mood with quotations on the joy of mathematics. This batch of quotations ends with the line from G.H.Hardy, "Beauty is the first test: there is no permanent place in this world for ugly mathematics." We'll see about that; I'm pretty sure that some ugly mathematics (or is that ugly mathematicians?) lie in wait for us a bit later. But I digress... Denise then gets to the meat of pre-algebra problem solving with posts on the tools and 2nd grade. In the comments to that first post, commenter Bill Howdle describes a (long ago) homework math problem that he was unable to help his daughter with, and after 25 years it still nags at him!

Probably everyone here has heard at some point the story of how, as a young child, Gauss discovered a formula for the sum of the first n positive integers. In Pairing up with Gauss, Math Mom describes how she teaches this to 10- to 12-year-old kids, using different arithmetic progressions to reinforce the pairing technique. While you're visiting, be sure to also check out the link she provides to an American Scientist article which dissects the Gauss myth.

For our next entry, Dave Marain of MathNotations shows how to find the Golden Ratio in the geometry of a certain isosceles triangle, in Searching for Gold in Geometry. Be sure to scroll down through the comments (this will be a recurring theme in this edition) to read Eric Jablow's nifty introduction to algebraic number theory.

If someone poses a problem about a random number between 1 and 10, I think it's safe to say that everyone would assume that the number is going to be uniformly distributed. But what if we're talking about some random mathematical object where there is not an obvious, intuitive choice for the distribution? Jonathan discusses What is a random triangle? over at jd2718. The post is short, but (you guessed it) much discussion is generated in the comments.

To end this category, Jonathan also recommends reading Pissed Off's discussion of whether partial credit should be given on math tests. Now, having spent some time grading student exams, I'm a big fan of multiple choice questions--preferably using one of those machine-readable bubble answer sheets so that one doesn't even have to look at the students' work. Pissed Off, to the contrary, seems to be basing her opinion on what might be best for the student and not the instructor!

The Bad

Next up for your viewing pleasure are the mathematicians, either as the subjects or the authors of blog entries...

John Kemeny of A Mispelt Bog has a nice post about an obscure result relating to patterns of digits in repeating decimals, that has recently been getting renewed attention. In The Secret Theorem of M. E. Midy = Casting In Nines, he tells how Midy's theorem has recently been rediscovered and extended. John is also offering up a short post looking at some statistics on Ph.D. graduation rates and SAT scores by state.

Next, John Armstrong of The Unapologetic Mathematician takes a break from his ongoing series on category theory to respond to a question that reader posed in a comment. In A little aside on linear algebra, John discusses the relationship between inner products, norms, and the choice of a basis in vector spaces.

Hmmm, only two math submitters this edition? Well, that just won't do, and fortunately there has been some other juicy math blogging recently that we can highlight.

Let's start with the low-brow... I've often thought that the way to attract more public interest in mathematics is, like just about everything else that is "marketed" these days, to sex it up a bit. The New York Times helped out in this regard with an article describing an argument by UC Berkeley mathematician David Gale, that the commonly reported statistics on male and female sex partners cannot possibly be correct. This was all over the blogosphere last week, but since no one else has submitted a relevant entry, I'll suggest taking a look at Men and Women Cannot Can Have Different Average Numbers of Sexual Partners by Jake Young at Pure Pedantry. Jake gives a nice recap of the arguments back and forth, and has so many updates based on reader comments that I lost count. The very first commenter gives a nice little example of how, while the means must be equal, the medians definitely might not.

For something a bit more high-brow, I'd recommend Ben Webster's post at the Secret Blogging Seminar on Zeta function relations and linearly equivalent group actions. Ben mentions that the subject of this post comes from some research he did as an undergrad, and it contains the prettiest looking math blogging I've seen recently. But what caught my attention was that the comments were devoted entirely to a discussion of using mathematicians' names as nouns versus adjectives when referring to eponymous mathematical structures.

To shift back to the low-brow for a moment, I noticed that Ben is also making a call to keep the sarong theorem archive growing. I have to admit that this is a nice picture of Ben, and math ed content is welcome, too.

I recently bought Danica McKellar's new book, Math Doesn't Suck, for my daughter. This book has already been the subject of much discussion on the web and I won't try to add anything here. But I've been looking without much luck for a comprehensible explanation of the research paper she co-authored, "Percolation and Gibbs states multiplicity for ferromagnetic Ashkin-Teller models on Z2". So, I was delighted to see that Terry Tao has done just that in his blog entry “Math Doesn’t Suck”, and the Chayes-McKellar-Winn theorem. Tao gives both a high-level and a fairly detailed explanation of what the theorem means, and also provides some recollections about Danica's time as a student.

Finally, we close the mathematicians' portion of our program with Greg Muller at The Everything Seminar railing against the bad math behind a classic gambling scheme that's "guaranteed" to pay off, in Infinite Series vs. Reason. Specifically, if you are, say, flipping a coin to determine whether you win a bet, and you double your wager after each round, then you're bound to come out ahead at some point, right? What could possibly go wrong?

The Ugly

Finally, we come to the computer science portion of our carnival...

...and there is nothing better to make the segue from bad math to ugly computer science than the following little brouhaha. Mathematician Neal Koblitz has an article in the September Notices of the AMS in which he criticizes the cryptographic community, and it evidently has many computer scientists up in arms. None of them felt compelled to submit their entries to the carnival, unfortunately; but being the lover of soap opera that I am, I will do the honors. Luca Trevisan at in theory writes about The Swift-Boating of Modern Cryptography, and it goes without saying that you must read the comments on this one. Lots of ugly trash-talking there, but no doubt Koblitz is a bad, bad, naughty mathematician who deserves it all :)

On a more positive note, Julie Rehmeyer at the Science News blog MathTrek has a couple of entries timed just perfectly for this edition. (And Julie is being promoted from math to computer science as well!)

In Squashing Worms, Julie describes research by Microsoft theoretician Jennifer Chayes into how computer worms spread through the internet, in order to calculate which hosts should get patched first to best slow the spread. There may also be implications of this research for biological organisms, and Chayes plans to work with epidemiologists to gain a better understanding of this.

In Julie's second entry for this edition, Kidney Matchmaking, we learn about new algorithms being designed to match kidney donors with patients needing transplants. An estimated 1,000–2,000 additional patients per year might receive transplants that otherwise wouldn't, once the techniques are implemented nationwide.

In the comments to Julie's second post, Suresh from The Geomblog mentions some additional research being done on the kidney transplant matching problem. In fact, he recently did a post on the subject himself, Saving lives with exact algorithms, which deserves its own mention here in the Carnival. The amazing take-home point from Julie's and Suresh's posts is that results from the study of algorithms are actually saving patients lives--concrete benefits that one would probably not expect from such an abstract topic.

Most of us are familiar with the history of Euclid's fifth (parallel) postulate, and how relaxing this requirement allows us to come up with different geometries in which "lines" differ from our usual intuition--for example, lines might correspond to great circles on a sphere. Now, what if we were to really relax the definition of what constitutes a line, to create something that "behaves like" a line but isn't required to be straight? According to David Eppstein at 0xDE, computational geometers do just this sort of thing, and the result is a pseudoline. However, different researchers have used different definitions for pseudolines, and in his post Was sind und was sollen die Pseudogeraden?, David attempts to clarify some of the resulting confusion about what the proper definition should be.

For our next entry, Aaron Sterling recommends an item from Scott Aaronson's blog Shtetl-Optimized. In Shor, I'll do it, Scott gives a plain-language explanation for Peter Shor's quantum factoring algorithm, which was one of the first algorithmic results exploiting the power of quantum computing. This is an older post, but one of Scott's most popular ones. Now, the comment section is always lively at Shtetl-Optimized, so it goes without saying that you want to check that out. Aaron mentions that you should particularly look for Robin Blume-Kohout's comment explaining the Fourier transform.

Finally, Aw, shucks is a very short post by Jeff Erickson at Ernie's 3D Pancakes. It seems that Jeff has a difference of opinion with Doron Zeilberger over the value and philosophical implications of computer-generated proofs, and these two gentlemen are not shy about, ahem, expressing their opinions. I can't quite decide if they love each other or hate each other's guts, but either way you've got to follow those links and read what they have to say...it seriously just doesn't get any better than this.


This concludes the 16th edition of the Carnival of Mathematics. The 17th edition will be hosted on 9/21 over at MathNotations by Dave Marain, who will undoubtedly handle the proceedings in a more timely fashion than moi.

Let me leave you with one final parting link, some words of encouragement from Professor Mark Sapir at Vanderbilt University. Be sure to turn up your speaker and click on the sound file at the bottom of the page!

Labels: ,

Friday, September 07, 2007

Tick, tock...

I'm feeling a little bit under the weather, so rather than trying to force myself to finish gestating the next Carnival of Mathematics, I'm going to get some rest. But don't worry, the delivery shouldn't be more than a few hours overdue.

Let me take this moment to remind everyone that the Blog Carnival submission form will continue to forward submissions to me until midnight tonight, so please do send in those last-minute entries. Or you can email them to me at kurt (at) learningcomputation (dot) com.

And now, back to bed. Zzzzzzzzz.

Labels: , ,

Sunday, August 26, 2007

Math Carnivalia: Present, Future and Past

The 15th Carnival of Mathematics is now up at John Kemeny's A Mispelt Bog, and it looks like a good one. I especially like how he has taken the time to provide some background on the posted subjects above and beyond what was in the post entries themselves. It definitely sets a high bar for whatever poor schlemiel is going to be hosting the next one.

Which reminds me, the 16th Carnival of Mathematics will be hosted by yours truly right here in two weeks, on September 7th. The theme for the next fortnight's edition will be:
How has the mathematical mindset shaped your self-actualization in a post-postmodern world?
I don't know about you, but I could write a few thousand words on that without even thinking... Hey, wait, come back! I'm only joking! The Carnival of Mathematics is not a "themed" carnival beyond the mission statement that applies to all editions. The short version, from the Blog Carnival entry for the CoM is as follows:
Everything math-related goes in here: proofs, explanations of basic concepts, puzzles, writings about math education, mathematical anecdotes, refutations of bad math, applications of math, reviews of popular math... Note that sufficiently mathematized portions of other disciplines, especially physics and computer science, are acceptable.
For a slightly longer version, check out Alon Levy's description at the CoM homepage. And for anyone who's stumbled upon this page without having encountered the notion of a blog carnival before, more information can be found at Wikipedia.

So, start sending those submissions my way. You can use the Blog Carnival submission form, or you can email your links to me at kurt (at) learningcomputation (dot) com. Please include "CoM" or "Math Carnival" or the like in your subject line so I don't mistake your message for spam.

Now, I'd like to make a couple of extra requests of you for the upcoming carnival, beyond what may have been done in the past:

First, note that Alon has added a bit of extra instruction for this edition on the submission form:
It's perfectly acceptable to nominate entries from other blogs. The limit of three posts per individual means that a single blogger may not have more than three posts in an edition; it does not mean you may not nominate many more posts from many blogs or bloggers.
Several people in the past have made the observation that there is a lot of interesting math blogging going on that for one reason or another never gets submitted. I think it was this little exchange with Noah Snyder at the Secret Blogging Seminar that finally convinced Alon to codify this into the carnival description. So if you come across an example of someone else's math blogging that you think deserves a wider audience, by all means submit it to the carnival. Let me know whether or not you've already mentioned it to the author, because I'd like to give them advance notice before linking to them.

Second, when you submit a link to me, please include a paragraph or so describing what the linked post is about. I'll certainly read through all of the submitted posts, but I know from reading past carnivals that there are some posts for which there is just no way I could do them justice in my own words. Heck, a couple of them might as well have been Greek to me...

Finally, there has been some discussion around the past few editions of the carnival concerning the mix of "math ed" posts and "math research" (for lack of a better term) posts, for example here, here and here. So as a little experiment, I'll be grouping the submissions by these categories. However, I know from past carnivals that some posts don't fit cleanly into one category or another, so let me know how you think your submissions should be grouped. If I receive enough suitable entries, I'll also create a "comp sci" category. The first few carnivals had several submissions dealing with algorithms and computational geometry, but comp sci has been AWOL lately. I'd really like to see that change.

Now if you'll excuse me, I'm going to return to perusing the 15th edition ...

Labels: ,

Monday, July 02, 2007

Carnival of Mathematics

I was just thinking to myself that it's been a long time since I've seen a new Carnival of Mathematics, and sure enough when I checked the calendar I found that the 11th edition is now up at Grey Matters. Hmmm, none of the math/cs blogs I read regularly posted any announcements about this; how am I supposed to remember these dates on my own? Maybe everyone is on vacation this week.

Perhaps it's just the summer doldrums, but this edition of the carnival seems a bit thin. There was a little bit of discussion back in the 10th edition about whether it might make sense to split into two separate carnivals: one for math ed and one for college and research level math. However, the current edition is almost all math ed, so perhaps the carnival will just evolve in that direction on its own. (There were also a couple of entries that really left me wondering what the authors were smoking, but that's another matter.)

There was one entry that struck me as being worth mentioning, though. John Armstrong at The Unapologetic Mathematician writes about categorification: the process of recasting a mathematical abstraction into the language of category theory, as a means of solidifying one's understanding of the topic. He gives some simple examples expressing addition and multiplication in terms of set operations, and reinterpreting the results in terms of category theory. As someone who doesn't know anything about category theory, I find this both intriguing and mystifying. He concludes his post with the adage, "If you want to understand something, try to categorify it!" I think that I first need to understand categories, and Armstrong has a series of posts on the basics of category theory that might help me in that regard.

While we're on the topic (sort of), I wonder if it would be worthwhile to try to split off the TCS-related posts from the Carnival of Mathematics into their own carnival? That might sound a little strange seeing as how there were exactly zero computer science posts in this edition, but I'm thinking that having our own carnival would encourage more submissions. Or is the TCS blogosphere so small (and we already read each other's blogs anyway) that having a carnival would be superfluous?

Labels: ,

Friday, May 18, 2007

Uncertainty

The title of this post is not a reference to quantum uncertainty, but rather to the notion of Platonic idealism suggested by today's xkcd comic titled Certainty (click on the image to see a bigger version so you can actually read the words):



It is, unfortunately, untrue.

Now, in practical terms, math as a school subject has a lot less uncertainty associated with it than, say, literary criticism. If you're asked on an exam to solve a given problem, chances are there is a specific answer which the instructor has in mind. However, even at this basic level, issues of interpretation come into play, as illustrated by what happened to Heath Raftery on a probability test. (It's particularly funny given how many people commented on that post to try to explain to Heath why he was wrong, when in fact he was absolutely correct.)

Even on a foundational level, mathematical truth is not as absolute as it is often assumed to be. Ever since Kurt Gödel's famous incompleteness theorems, it's been known that any sufficiently powerful axiomatic system cannot be both consistent and complete. But it is not necessary to invoke such a deep result to understand the potential limitations of mathematics. The rules of inference used to generate theorems are themselves crafted from empirical observation of the world. We learn from experience that if, say, A implies B and B implies C, then A implies C. These rules seem so natural that it can be hard to imagine that they are not of necessity true. The truth is that the rules of inference must be assumed to be true, along with any other axioms we are using. And not all mathematicians agree on which rules of inference should be included; for example the field of constructive mathematics rejects certain types of inferences used in classical mathematics.

The nicest explication of this idea that I've come across is an essay written in 1895 by Lewis Carroll, titled What the Tortoise said to Achilles. This dialog between the fictional Tortoise and Achilles was also included in Douglas Hofstadter's book Godel, Escher, Bach: An Eternal Golden Braid and served as the jumping-off point for Hofstadter's own set of dialogs. (If you haven't seen it before, I strongly urge you to read Carroll's essay; it's short, it's funny, and as they say, it contains no mathematics!)

Labels: