Archive for June, 2009
Tuesday, June 30th, 2009
MMM #35 turned out to be harder than I thought judging by the small number of submissions I received.
I'll be giving away four prizes on Friday - two to the early submitters, one to .mau. for consistently submitting entries to the contest for a really long time, and one to ...
Posted in Uncategorized | 3 Comments »
Monday, June 29th, 2009
Hi,
I've been playing with this series:
Sn = 1x22 + 2x32 + 3x42 + ... + nx(n+1)2
I've come up with a formula for determining Sn but I derived the formula in a fairly roundabout way.
I'm interested to know if someone has an elegant way to derive the formula.
SHARETHIS.addEntry({
title: "Can you ...
Posted in Uncategorized | 15 Comments »
Thursday, June 25th, 2009
I've only gotten two solutions to the "Fibonacci Fun" problem I proposed. Is everyone on vacation and not thinking about Math, do people find the problem boring or is it too hard? I don't think it's one of my harder problems. I want to state that I approached the problem ...
Posted in Uncategorized | 5 Comments »
Monday, June 22nd, 2009
Blinkdagger has announced the winner and the solution for MMM #34. Now, it's time for MMM #35.
I want to thank Blinkdagger for running 17 contests over the last year and a half. Quan and Daniel have done an excellent job of creating problems and engaging you with fun problem descriptions ...
Posted in Uncategorized | 3 Comments »
Saturday, June 6th, 2009
Random.org picked Nikhil Chelliah as the winner for MMM #33. Congratulations, Nikhil!
Here is the problem description:
What’s the prime factorization of the smallest whole number that is divisible by all integers from 1 up to and including 50?
Here is Nikhil's solution:
The least common multiple of a group of numbers, has, for ...
Posted in Uncategorized | 2 Comments »
