## Monday Math Madness #9

Last Friday Blinkdagger announced a winner for MMM #8. Here's MMM #9:

Consider all of the 6-digit numbers that one can construct using each of the digits between 1 and 6 inclusively exactly one time each. 123456 is such a number as is 346125. 112345 is not such a number since 1 is repeated and 6 is not used.How many of these 6-digit numbers are divisible by 8?

While you may use a computer program to verify your answer, show how to solve the problem without use of a computer.

I have a Rubik's Revolution, courtesy of Techno Source, (or $10 Amazon.com gift certificate) to give to the winner. I'll give more than one prize if I get lots of correct submissions.

Here are the rules for the contest:

1. Email your answers with solutions to mondaymathmadness at gmail dot com.

2. Only one entry per person.

3. Each person may only win one prize per 12 month period. But, do submit your solutions even if you are not eligible.

3. Your answer must be explained. You must show your work! Wild About Math! and Blinkdagger will be the final judges on whether an answer was properly explained or not.

4. The deadline to submit answers is Tuesday, July 1, 2008 12:01AM, Pacific Time. (That’s Tuesday morning, not Tuesday night.)

5. The winner will be chosen randomly from all timely well-explained and correct submissions, using a random number generator.

6. The winner will be announced Friday, July 4, 2008.

7. The winner (or winners) will receive a Rubik's Revolution or a $10 gift certificate to Amazon.com.

8. Comments for this post should only be used to clarify the problem. Please do not discuss ANY potential solutions.

9. I may post names and website/blog links for people submitting timely correct well-explained solutions.

UnAJune 23rd, 2008 - 09:27

first +)

MgcclJune 25th, 2008 - 10:32

pwned the question…

omg how I wish if I win this time.. I can get bookz…

pareshJuly 1st, 2008 - 09:32

nice puzzle.

spxzaJuly 1st, 2008 - 13:03

Damn, one hour too late. 84 was my answer, using c++.

C. BurkeJuly 3rd, 2008 - 08:27

Figuring it out logically, I came up with 90.

Then, I rechecked my work to find that one silly, little error in calculating that I always seem to make on simple little puzzles like this and came up with 84.

(And yet my students NEVER believe me about the importance of checking their work.)

I’d try to find all the numbers on paper, but since spxza used C++ and got the same answer, that should be confirmation enough.