Given that 1 ≤ x ≤ k , there are 2017 solutions to the equation x 3 − ⌊ x 3 ⌋ = ( x − ⌊ x ⌋ ) 3 . The minimum value of k is a + d b c , where a , b , c , d are positive integers.
Given that c is square-free and b and d are coprime, find the value of a + b + c + d .
Notation:
⌊
⋅
⌋
denotes the
floor function
.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Such a genius! By the way, I solve it the same way, thanks for this hard question!
We get x 3 − 1 = ( x − 1 ) 3
This yields exactly one real solution at x = 1
Similar would take place till 6 ≤ x 3 < 7 and we would get some irrational solutions, but no solution when 7 ≤ x 3 < 8
Instead one is noticed at x 3 = 8 , in the equation : x 3 − 8 = ( x − 2 ) 3 which has a solution at x = 2
We may also say that the solution at the intervals 7 ≤ x 3 < 8 and 8 ≤ x 3 < 9 coincides at x = 8.
As 1 2 3 = 1 7 2 8 and 1 3 3 = 2 1 9 7 , so there will be overall 11 ( x = 2 , 3 , 4 , . . 1 2 ) coinciding cases till 2017
So the 2 0 1 7 t h solution will exist at 2 0 1 7 + 1 1 = 2 0 2 8
Thus our equation will become x 3 − 2 0 2 8 = ( x − 1 2 ) 3 which solves to 3 x 2 − 3 6 x − 2 5 = 0
x = 6 + 1 3 3 9 9
Problem Loading...
Note Loading...
Set Loading...
Let x = n + α , where ⌊ x ⌋ = n . Then, 0 ≤ α < 1 .
Knowing that x − ⌊ x ⌋ = n + α − n = α , we see that
( n + α ) 3 − ⌊ ( n + α ) 3 ⌋ = α 3 n 3 + 3 n 2 α + 3 n α 2 + α 3 − ⌊ n 3 + 3 n 2 α + 3 n α 2 + α 3 ⌋ = α 3 n 3 + 3 n 2 α + 3 n α 2 = ⌊ n 3 + 3 n 2 α + 3 n α 2 + α 3 ⌋ .
Since 0 ≤ α 3 < 1 and the RHS is an integer, we deduce that 3 n 2 α + 3 n α 2 is an integer. ( n 3 is an integer)
Let 3 n 2 α + 3 n α 2 = m , and solve for α .
α = 6 n − 3 n 2 + 9 n 4 + 1 2 m n = − 2 n + 4 n 2 + 3 n m . ( ∵ α > 0 )
Solving 0 ≤ α < 1 , we find 0 ≤ m < 3 n ( n + 1 ) .
Therefore there are 3 n ( n + 1 ) possible values for m .
Note that if m changes, x changes its value as well.
The number of x when 1 ≤ n ≤ k is i = 1 ∑ k 3 i ( i + 1 ) = 2 k ( k + 1 ) ( 2 k + 1 ) + 2 3 k ( k + 1 ) = k ( k + 1 ) ( k + 2 ) < 2 0 1 7 .
Since 1 1 × 1 2 × 1 3 = 1 7 1 6 , we find that the minimum of k is the 2 0 1 7 − 1 7 1 6 = 3 0 1 th number with an integer part of 1 2 .
The first number with an integer part of 1 2 is of course, 1 2 , when m = 0 .
This shows that the minimum of k occurs when m = 3 0 0 .
α = − 2 1 2 + 4 1 2 2 + 3 ⋅ 1 2 3 0 0 = − 6 + 3 3 9 9 .
Therefore, the minimum of k is n + α = 1 2 + ( − 6 + 3 3 9 9 ) = 6 + 3 3 9 9 .
∴ a + b + c + d = 6 + 1 + 3 9 9 + 3 = 4 0 9 .