Difference between revisions of "2006 AIME II Problems/Problem 3"
m (→Solution 4) |
|||
(8 intermediate revisions by 6 users not shown) | |||
Line 18: | Line 18: | ||
threes in <math>100!</math> | threes in <math>100!</math> | ||
− | Therefore, we have a total of <math>97-48=049</math> threes. | + | Therefore, we have a total of <math>97-48=\boxed{049}</math> threes. |
For more information, see also [[Factorial#Prime factorization| prime factorizations of a factorial]]. | For more information, see also [[Factorial#Prime factorization| prime factorizations of a factorial]]. | ||
− | == Solution | + | == Solution 2 == |
We count the multiples of <math>3^k</math> below 200 and subtract the count of multiples of <math>2\cdot 3^k</math>: | We count the multiples of <math>3^k</math> below 200 and subtract the count of multiples of <math>2\cdot 3^k</math>: | ||
<cmath>\left\lfloor \frac{200}{3}\right\rfloor - \left\lfloor \frac{200}{6}\right\rfloor +\left\lfloor\frac{200}{9}\right\rfloor - \left\lfloor \frac{200}{18}\right\rfloor +\left\lfloor \frac{200}{27}\right\rfloor - \left\lfloor \frac{200}{54}\right\rfloor+\left\lfloor\frac{200}{81}\right\rfloor - \left\lfloor \frac{200}{162}\right\rfloor</cmath> | <cmath>\left\lfloor \frac{200}{3}\right\rfloor - \left\lfloor \frac{200}{6}\right\rfloor +\left\lfloor\frac{200}{9}\right\rfloor - \left\lfloor \frac{200}{18}\right\rfloor +\left\lfloor \frac{200}{27}\right\rfloor - \left\lfloor \frac{200}{54}\right\rfloor+\left\lfloor\frac{200}{81}\right\rfloor - \left\lfloor \frac{200}{162}\right\rfloor</cmath> | ||
<cmath>= 66 - 33 + 22 - 11 + 7 - 3 + 2 - 1 = 49.</cmath> | <cmath>= 66 - 33 + 22 - 11 + 7 - 3 + 2 - 1 = 49.</cmath> | ||
+ | |||
+ | == Solution 3 == | ||
+ | We can use a modified version of Legendre's Formula. First, we count the number of multiples of 3 in the sequence 1, 3, 5, 7, 9, ..., 195, 197, 199. | ||
+ | |||
+ | This is the same as the number of multiples of 3 in the sequence 3, 9, 15, 21, ..., 192, 195. There are clearly 33 terms in this sequence. | ||
+ | |||
+ | Next, we count the number of multiples of 9 in the sequence 1, 3, 5, 7, 9, ..., 195, 197, 199. This is the same as the number of multiples of 9 in the sequence 9, 18, 27, 36, ...., 189, 198 - but there's a catch. Note that every other member of this sequence isn't odd and thus is not part of the product of the first 100 odd integers, so our new sequence is actually 9, 27, 45...189. Divide every term by 9 to get a new sequence; 1, 3, 5...21, which clearly has 11 terms. | ||
+ | |||
+ | Next, we similarly count the number of multiples of 27 in the sequence 1, 3, 5, 7, 9, ..., 195, 197, 199. This is just 27, 81, 135, 189, so 4 multiples here. | ||
+ | |||
+ | Finally, we count the number of multiples of 81 in the sequence 1, 3, 5, 7, 9, ..., 195, 197, 199. There is only one such multiple, 81. | ||
+ | |||
+ | Any power of 3 above 81 doesn't fit into our sequence. | ||
+ | |||
+ | Finally, we have 33+11+4+1=49. | ||
+ | |||
+ | Our final answer is 49. | ||
+ | |||
+ | (Note that I oversimplified this a lot, in real life we wouldn't have to list out the sequences as tediously as I did). | ||
+ | |||
+ | ==Solution 4== | ||
+ | We are obviously searching for multiples of three set S of odd numbers 1-199. Starting with 3, every number <math>\equiv 2 \pmod{3}</math> in set S will be divisible by 3. In other words, every number <math>\equiv 3 \pmod{6}</math>. This is because the LCM must be divisible by 3, and 2, because the set is comprised of only odd numbers. Using some simple math, there are 33 numbers that fit this description. All you have to do is find the largest odd number that is divisible by 3 and below 200, then add 3 and divide by 6. Next, we find the number of odd digits below 200 that are divisible by 9. The same strategy works, and gives us 11. 27 gives 3, and 81 gives 1. <math>33 + 11 + 4 + 1 = \boxed{49}</math>. | ||
+ | |||
+ | |||
+ | -jackshi2006 | ||
+ | |||
== See also == | == See also == | ||
* [[Number Theory]] | * [[Number Theory]] |
Latest revision as of 18:37, 30 October 2020
Problem
Let be the product of the first
positive odd integers. Find the largest integer
such that
is divisible by
Solution
Note that the product of the first positive odd integers can be written as
Hence, we seek the number of threes in decreased by the number of threes in
There are
threes in and
threes in
Therefore, we have a total of threes.
For more information, see also prime factorizations of a factorial.
Solution 2
We count the multiples of below 200 and subtract the count of multiples of
:
Solution 3
We can use a modified version of Legendre's Formula. First, we count the number of multiples of 3 in the sequence 1, 3, 5, 7, 9, ..., 195, 197, 199.
This is the same as the number of multiples of 3 in the sequence 3, 9, 15, 21, ..., 192, 195. There are clearly 33 terms in this sequence.
Next, we count the number of multiples of 9 in the sequence 1, 3, 5, 7, 9, ..., 195, 197, 199. This is the same as the number of multiples of 9 in the sequence 9, 18, 27, 36, ...., 189, 198 - but there's a catch. Note that every other member of this sequence isn't odd and thus is not part of the product of the first 100 odd integers, so our new sequence is actually 9, 27, 45...189. Divide every term by 9 to get a new sequence; 1, 3, 5...21, which clearly has 11 terms.
Next, we similarly count the number of multiples of 27 in the sequence 1, 3, 5, 7, 9, ..., 195, 197, 199. This is just 27, 81, 135, 189, so 4 multiples here.
Finally, we count the number of multiples of 81 in the sequence 1, 3, 5, 7, 9, ..., 195, 197, 199. There is only one such multiple, 81.
Any power of 3 above 81 doesn't fit into our sequence.
Finally, we have 33+11+4+1=49.
Our final answer is 49.
(Note that I oversimplified this a lot, in real life we wouldn't have to list out the sequences as tediously as I did).
Solution 4
We are obviously searching for multiples of three set S of odd numbers 1-199. Starting with 3, every number in set S will be divisible by 3. In other words, every number
. This is because the LCM must be divisible by 3, and 2, because the set is comprised of only odd numbers. Using some simple math, there are 33 numbers that fit this description. All you have to do is find the largest odd number that is divisible by 3 and below 200, then add 3 and divide by 6. Next, we find the number of odd digits below 200 that are divisible by 9. The same strategy works, and gives us 11. 27 gives 3, and 81 gives 1.
.
-jackshi2006
See also
2006 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 2 |
Followed by Problem 4 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.