Difference between revisions of "2012 AIME I Problems/Problem 1"
m (→Solution 2) |
m (→Solution 1) |
||
Line 6: | Line 6: | ||
=== Solution 1 === | === Solution 1 === | ||
− | A positive integer is divisible by <math>4</math> if and only if its last two digits are divisible by <math>4.</math> For any value of <math>b</math>, there are two possible values for <math>a</math> and <math>c</math>, since we find that if <math>b</math> is even, <math>a</math> and <math>c</math> must be either <math>4</math> or <math>8</math>, and if <math>b</math> is odd, <math>a</math> and <math>c</math> must be either <math>2</math> or <math>6</math>. There are thus <math>2 \cdot 2 = 4</math> ways to choose <math>a</math> and <math>c</math> for each <math>b,</math> and <math>10</math> ways to choose <math>b</math> since <math>b</math> can be any digit. The final answer is then <math>4 \cdot 10 = \boxed{ | + | A positive integer is divisible by <math>4</math> if and only if its last two digits are divisible by <math>4.</math> For any value of <math>b</math>, there are two possible values for <math>a</math> and <math>c</math>, since we find that if <math>b</math> is even, <math>a</math> and <math>c</math> must be either <math>4</math> or <math>8</math>, and if <math>b</math> is odd, <math>a</math> and <math>c</math> must be either <math>2</math> or <math>6</math>. There are thus <math>2 \cdot 2 = 4</math> ways to choose <math>a</math> and <math>c</math> for each <math>b,</math> and <math>10</math> ways to choose <math>b</math> since <math>b</math> can be any digit. The final answer is then <math>4 \cdot 10 = \boxed{40.}</math> |
=== Solution 2 === | === Solution 2 === |
Revision as of 23:13, 8 February 2013
Problem 1
Find the number of positive integers with three not necessarily distinct digits, , with and such that both and are multiples of .
Solutions
Solution 1
A positive integer is divisible by if and only if its last two digits are divisible by For any value of , there are two possible values for and , since we find that if is even, and must be either or , and if is odd, and must be either or . There are thus ways to choose and for each and ways to choose since can be any digit. The final answer is then
Solution 2
A number is divisible by four if its last two digits are divisible by 4. Thus, we require that and are both divisible by . If is odd, then and must both be meaning that and are or . If is even, then and must be meaning that and are or . For each choice of there are choices for and for for a total of numbers.
See also
2012 AIME I (Problems • Answer Key • Resources) | ||
Preceded by First Problem |
Followed by Problem 2 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |