Difference between revisions of "2003 AIME I Problems/Problem 9"
(→Problem) |
m |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | An integer between 1000 and 9999, inclusive, is called balanced if the sum of its two leftmost | + | An [[integer]] between 1000 and 9999, inclusive, is called ''balanced'' if the sum of its two leftmost [[digit]]s equals the sum of its two rightmost digits. How many balanced integers are there? |
== Solution == | == Solution == | ||
| − | + | {{solution}} | |
== See also == | == See also == | ||
| + | * [[2003 AIME I Problems/Problem 8 | Previous problem]] | ||
| + | * [[2003 AIME I Problems/Problem 10 | Next problem]] | ||
* [[2003 AIME I Problems]] | * [[2003 AIME I Problems]] | ||
| + | |||
| + | [[Category: Intermediate Combinatorics Problems]] | ||
Revision as of 17:07, 24 October 2006
Problem
An integer between 1000 and 9999, inclusive, is called balanced if the sum of its two leftmost digits equals the sum of its two rightmost digits. How many balanced integers are there?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
