|
Well, I think you translated the problem incorrectly.
However, I got your idea. I can give you a hint. We have two steps to go.
1st, you have to give an upper bound of the candidates. Second, you test all the candidates in a smart way. Then you can figure out which one is the greatest number satisfying this divisible property.
The second step is an easy routine. To achieve the first step, we denote the candidate number as M=A*b.
Suppose n < = M^(1/3) < n+1. Here we assume A is the least common multiple of 1,2,3,....,n, and b is some positive integer. Therefore, we get
n^3 <= A*b < (n+1)^3 .
We want to use the right hand side to get an upper bound of A. Namely,
A < = A*b < (n+1)^3
Once you derive an upper bound of M from the above inequality, you can easily get the answer. It takes efforts to conquer this first step. Hope this helps. Good luck! Young man!
原帖由 swordtrail 於 2008-2-1 05:29 發表
I think you may have misunderstood the question...
It means that every positive integer less than the cube root of n is divisable of n...
Does it make it clearer that way???
Can you help??? |
評分
-
查看全部評分
|