I was looking at this article (The Genuine Sieve of Eratosthenes / PDF) about a common functional prime number generator that is mistakenly called the Sieve of Eratosthenes. It is quite complicated, section 2 deals with the performance of the naive algorithm »
If p is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120. {20,48,52}, {24,45,51}, {30,40,50} For which value of p < 1000, is the number of solutions maximised? You may remember »
Go and read Pupils to get ‘new world’ trips from the beeb. You may think “trips abroad for kids, great” , if you are more cynical you may think “heads choose the kids, not sure I like that”. Let us do some arithmetic, 100 kids for 6 weeks each for »
You are walking home late at night and two girls run past, one turns to the other and says “this is the millionth time I have ran today” and you cannot help but say “You would have to start and stop running 10 times a second, while you said that you would »
You are singing the song that goes “I got love for you if you were born in the 80s” and your girlfriend (who was born in 1979) says “what, no love for me?” and you reply “actually what I said does not imply that at all, you cant just negate both sides »
I posted last time about TeXmacs and remembered the plugins for using it to display output from some of the superb free maths packages (which sometimes lack a nice display). The one I am excited about most is for SAGE. SAGE is written in python and leverages »