Difference between revisions of "2004 AIME I Problems/Problem 6"
m |
|||
| Line 3: | Line 3: | ||
== Solution == | == Solution == | ||
| + | {{solution}} | ||
| + | == See also == | ||
| + | * [[2004 AIME I Problems/Problem 5| Previous problem]] | ||
| + | |||
| + | * [[2004 AIME I Problems/Problem 7| Next problem]] | ||
| − | |||
* [[2004 AIME I Problems]] | * [[2004 AIME I Problems]] | ||
Revision as of 14:59, 18 August 2006
Problem
An integer is called snakelike if its decimal representation 
satisfies 
if 
is odd and 
if is even. How many snakelike integers between 1000 and 9999 have four distinct digits?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
