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

Revision as of 13:59, 25 September 2007

Problem

Find the least positive integer such that when its leftmost digit is deleted, the resulting integer is 1/29 of the original integer.

Solution

Note that the product of the first $\displaystyle 100$ positive odd integers can be written as $\displaystyle 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 $\displaystyle 200!$ decreased by the number of threes in $\displaystyle 100!.$

There are

$\displaystyle \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 $\displaystyle 200!$ and

$\displaystyle \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 $\displaystyle 100!$

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

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

@@ Line 1: / Line 1: @@
 == Problem ==
-Let <math> \displaystyle P </math> be the product of the first <math>\displaystyle 100</math> [[positive integer | positive]] [[odd integer]]s. Find the largest integer <math>\displaystyle k </math> such that <math>\displaystyle P </math> is divisible by <math>\displaystyle 3^k .</math>
+Find the least positive integer such that when its leftmost digit is deleted, the resulting integer is 1/29 of the original integer.
 == Solution ==

Page

Toolbox

Search

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

Revision as of 13:59, 25 September 2007

Problem

Solution

See also