AoPSWiki
Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's NEW Intermediate Counting & Probability by David Patrick.
Personal tools

2007 AIME II Problems/Problem 7

From AoPSWiki

Problem

Given a real number let denote the greatest integer less than or equal to For a certain integer there are exactly positive integers such that k=\lfloor\sqrt[3]{n_{1}}\rfloor = \lfloor\sqrt[3]{n_{1}}\rfloor = \cdots = \lfloor\sqrt[3]{n_{70}}\rfloor and divides for all such that

Find the maximum value of for

Solution

For , we see that all work, giving 7 integers. For , we see that in \sqrt[3]{8} \ldots \sqrt[3]{26}, all of the even numbers work, giving 10 integers. For , we get 13, and so on. We can predict that at we get 70.

To prove this, note that all of the numbers from \sqrt[3]{x^3} \ldots \sqrt[3]{(x+1)^3 - 1} divisible by work. Thus, \frac{(x+1)^3 - 1 - x^3}{x} + 1  = \frac{3x^2 + 3x + 1 - 1}{x} + 1 = 3x + 4 (the one to be inclusive) integers will fit the conditions. 3k + 4 = 70 \Longrightarrow k = 22.

The maximum value of \displaystyle n_i = (x + 1)^3 - 1. Therefore, the solution is \frac{23^3 - 1}{22} = \frac{(23 - 1)(23^2 + 23 + 1)}{22} = 529 + 23 + 1 = 553.

See also

2007 AIME II (ProblemsResources)
Preceded by
Problem 6
Followed by
Problem 8
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Support local problem solving programs by contributing to the Art of Problem Solving Foundation.
Click here for more information about the Foundation.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us