9 + ⌊ x ⌋ 2 + ⌊ 2 x ⌋ 2 = ⌊ x 2 ⌋ + ⌊ ( 2 x ) 2 ⌋
Let x max denote the maximum value of x in the interval 0 < x < 1 0 that satisfy the equation above. Find ⌊ 1 0 0 x max ⌋ .
You might need a calculator for the final step of your working.
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.
A very cute problem. Thanks for sharing.
You can substitute x for x = N + 0 . 5 , where N is an integer. The floor brackets that do not have a remaining constant term inside them can be removed, and N comes out to be 9 . As a result, x = 9 + 0 . 5 = 9 . 5 . However, this is not the maximum solution...
Now by testing 9 . 5 5 , 9 . 6 and 9 . 7 , they do not work. This means that 9 . 5 < x < 9 . 5 5 . By testing 9 . 5 1 , the correct answer of 9 5 1 can be derived.
Problem Loading...
Note Loading...
Set Loading...
In this solution, [ x ] will denote the greatest integer function (the greatest integer less than or equal to x )
Note that all positive real numbers can be uniquely represented by x = a 2 + k a ∈ Z , 0 ≤ k < 2 a + 1 because a 2 + k also uniquely represents all real numbers.
Plugging this expression in for x gives 9 + [ a 2 + k ] 2 + [ 2 a 2 + k ] 2 = [ ( a 2 + k ) 2 ] + [ ( 2 a 2 + k ) 2 ] Now we simplify: 9 + [ a 2 + k ] 2 + [ 4 a 2 + 4 k ] 2 = [ a 2 + k ] + [ 4 a 2 + 4 k ]
Note that since a ≤ a 2 + k < a + 1 we must have [ a 2 + k ] = a . Also, note that [ a 2 + k ] = a 2 + [ k ] and [ 4 a 2 + 4 k ] = 4 a 2 + [ 4 k ] which simplifies matters to 9 + [ 4 a 2 + 4 k ] 2 = 4 a 2 + [ k ] + [ 4 k ] after cancelling a 2 from both sides.
Finally, we notice that when 0 ≤ k ≤ a + 4 1 , then 2 a ≤ 4 a 2 + 4 k < 2 a + 1 and when a + 4 1 ≤ k < 2 a + 1 then 2 a + 1 ≤ 4 a 2 + 4 k < 2 a + 2 so we have two cases:
Case 1: 0 ≤ k < a + 4 1
In this case, [ 4 a 2 + 4 k ] = 2 a so our equation simplifies to 9 = [ k ] + [ 4 k ] Note that the RHS is an increasing sequence, and that 1 + 4 3 ≤ k < 2 gives R H S = 8 while k = 2 gives R H S = 1 0 , so this case is impossible to satisfy.
Case 2: a + 4 1 ≤ k < 2 a + 1
In this case, [ 4 a 2 + 4 k ] = 2 a + 1 so our equation turns into 1 0 + 4 a = [ k ] + [ 4 k ] after simplification. To maximize x , we try a = 9 . Then our restriction is 9 + 4 1 ≤ k < 1 9 and [ k ] + [ 4 k ] = 4 6 which is satisfied when 9 + 4 1 ≤ k < 9 + 2 1 which fits our restriction.
Thus, x = 9 2 + 9 + 2 1 − ε = 2 1 8 1 − ε where ε > 0 is a very small number. No matter, we get that [ 1 0 0 x ] = 9 5 1 with a calculator and we are done.