Difference between revisions of "2006 AIME II Problems/Problem 3"

Revision as of 21:54, 23 April 2020

Problem

Let $P$ be the product of the first $100$ positive odd integers. Find the largest integer $k$ such that $P$ is divisible by $3^k .$

Solution

Note that the product of the first $100$ positive odd integers can be written as $1\cdot 3\cdot 5\cdot 7\cdots 195\cdot 197\cdot 199=\frac{1\cdot 2\cdots200}{2\cdot4\cdots200} = \frac{200!}{2^{100}\cdot 100!}$

Hence, we seek the number of threes in $200!$ decreased by the number of threes in $100!.$

There are

$\left\lfloor \frac{200}{3}\right\rfloor+\left\lfloor\frac{200}{9}\right\rfloor+\left\lfloor \frac{200}{27}\right\rfloor+\left\lfloor\frac{200}{81}\right\rfloor =66+22+7+2=97$

threes in $200!$ and

$\left\lfloor \frac{100}{3}\right\rfloor+\left\lfloor\frac{100}{9}\right\rfloor+\left\lfloor \frac{100}{27}\right\rfloor+\left\lfloor\frac{100}{81}\right\rfloor=33+11+3+1=48$

threes in $100!$

Therefore, we have a total of $97-48=\boxed{049}$ threes.

For more information, see also prime factorizations of a factorial.

Solution 2

We count the multiples of $3^k$ below 200 and subtract the count of multiples of $2\cdot 3^k$ :

$\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$ $= 66 - 33 + 22 - 11 + 7 - 3 + 2 - 1 = 49.$

Solution 3

We can use a similar 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 3

@@ Line 28: / Line 28: @@
 <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>
+== Solution 3 ==
+We can use a similar 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 3
 == 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

Page

Toolbox

Search