More Fizz than Buzz

I downloaded the first beta release of Python 3 which corresponded with another thread on FizzBuzz in c.l.p that featured some slick maths using Fermats little theorem, (yep it's really called that). I learnt a little about the theorem, did a quick spreadsheet to show that it worked, but could not grasp how they made it work in their examples.

It did however get me toying with Py3K where I came up with this snippet of code from the description of the problem.

The Problem:

Write a program that prints the numbers from 1 to 100. But for
multiples of three print "Fizz" instead of the number and for the
multiples of five print "Buzz". For numbers which are multiples of
both three and five print "FizzBuzz"

 
My Py3K solution:

print( ' '.join(
    'FizzBuzz' if i%15 == 0
    else 'Buzz' if i%5 == 0
    else 'Fizz' if i%3 == 0
    else str(i)
    for i in range(1,101)))

What I like about this solution is it applies the constraints from the problem description in the (reverse) order that they are given, and does not rely on the elementary (to pythoneers), knowledge that a test for not(X) is equivalent to a test of whether X==0. I'd be happy to put this in, say a Wikipedia type article on FizzBuzz, or teach it to newbies ready for immersion into gencomps (as maybe the second or third example). 

- One for trainers.

- Paddy.