Difference between revisions of "2006 AIME A Problems/Problem 3"
(→Solution) |
m |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | Let <math> \displaystyle P </math> be the product of the first <math>\displaystyle 100</math> positive odd | + | 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> |
== Solution == | == Solution == |
Revision as of 16:01, 12 October 2006
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.