# Difference between revisions of "2007 AMC 12A Problems/Problem 16"

Mathpro12345 (talk | contribs) (→==) |
Mathpro12345 (talk | contribs) (→See also) |
||

Line 34: | Line 34: | ||

=STOP IT= | =STOP IT= | ||

− | |||

− | |||

− | |||

− | |||

− | |||

− | |||

− |

## Revision as of 17:41, 9 December 2020

## Contents

## Problems

How many three-digit numbers are composed of three distinct digits such that one digit is the average of the other two?

## Solution 1

We can find the number of increasing arithmetic sequences of length 3 possible from 0 to 9, and then find all the possible permutations of these sequences.

Common difference | Sequences possible | Number of sequences |

1 | 8 | |

2 | 6 | |

3 | 4 | |

4 | 2 |

This gives us a total of sequences. There are to permute these, for a total of .

However, we note that the conditions of the problem require three-digit numbers, and hence our numbers cannot start with zero. There are numbers which start with zero, so our answer is .

## Solution 2

Observe that, if the smallest and largest digit have the same parity, this uniquely determines the middle digit. If the smallest digit is not zero, then any choice of the smallest and largest digit gives possible 3-digit numbers; otherwise, possible 3-digit numbers. Hence we can do simple casework on whether 0 is in the number or not.

Case 1: 0 is not in the number. Then there are ways to choose two nonzero digits of the same parity, and each choice generates 3-digit numbers, giving numbers.

Case 2: 0 is in the number. Then there are ways to choose the largest digit (2, 4, 6, or 8), and each choice generates 3-digit numbers, giving numbers.

Thus the total is . (by scrabbler94)