2008 iTest Problems/Problem 81

Revision as of 19:27, 21 November 2018 by Rockmanex3 (talk | contribs) (Solution to Problem 81 -- an easy problem late in the test)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Compute the number of $7$-digit positive integers that start $\textit{or}$ end (or both) with a digit that is a (nonzero) composite number.

Solution

Rather than counting the seven-digit positive integers that start or end with a nonzero composite digit, we can use complementary counting by counting the total number of seven-digit integers and the number of seven-digit integers that do not start and end with nonzero composite digits.


Of the 10 digits, four of them are composite (4, 6, 8, 9), so six of the digits are not composite. There are five ways to pick a non-composite digit for the first digit (since the number can not start with a 0) and six ways to pick a non-composite digit for the last digit. Thus, there are $5 \cdot 6 \cdot 10^5 = 3000000$.


The total number of 7-digit numbers is $9 \cdot 10^6 = 9000000$, so the total number of 7-digit numbers that start or end with a composite digit is $9000000 - 3000000 = \boxed{6000000}$.

See Also

2008 iTest (Problems)
Preceded by:
Problem 80
Followed by:
Problem 82
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
Invalid username
Login to AoPS