Find the minimum value of f ( x ) for real x such that
f ( x ) = ∣ x − 1 3 ∣ + ∣ 2 x − 2 3 ∣ + ∣ 3 x − 3 3 ∣ + . . . + ∣ 1 9 x − 1 9 3 ∣ + ∣ 2 0 x − 2 0 3 ∣
If the answer can be written as 2 a 2 , where a is a positive integer, find the value of a .
This is not my original problem, as it is a modification of a competition problem.
You can attempt the full set of problems here .
This is part of the set Things Get Harder! .
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.
Quite a good observation..(+1)!!!!
@rajdeep brahma Thanks!
I recognize this :D
Log in to reply
@Kenneth Tan It's from the Chen Jing Run Math Competition 2017 though I did not get this correct in that contest. I just make a few changes to that problem. Anyway how do you solve this problem?
The zero-points of each absolute term ∣ x − 1 3 ∣ , ∣ 2 x − 2 3 ∣ , ∣ 3 x − 3 3 ∣ , … , ∣ 2 0 x − 2 0 3 ∣ are x = 1 2 , x = 2 2 , x = 3 2 , … , x = 2 0 2 respectively, thus if we continuously crank x from − ∞ to ∞ , the signs of ∣ x − 1 3 ∣ , ∣ 2 x − 2 3 ∣ , ∣ 3 x − 3 3 ∣ , … , ∣ 2 0 x − 2 0 3 ∣ all start at negative and will take turns become positive (i.e. first the sign of ∣ x − 1 3 ∣ becomes positive when we crank x past 1 2 , then followed by ∣ 2 x − 2 3 ∣ past x = 2 2 , then ∣ 3 x − 3 3 ∣ etc.)
Plot a "derivative table":
x < 1 2 1 2 ⩽ x < 2 2 2 2 ⩽ x < 3 2 3 2 ⩽ x < 4 2 ⋮ 1 9 2 ⩽ x < 2 0 2 2 0 2 ⩽ x d x d ∣ x − 1 3 ∣ − 1 + 1 + 1 + 1 ⋮ + 1 + 1 d x d ∣ 2 x − 2 3 ∣ − 2 − 2 + 2 + 2 ⋮ + 2 + 2 d x d ∣ 3 x − 3 3 ∣ − 3 − 3 − 3 + 3 ⋮ + 3 + 3 … … … … … ⋱ … … d x d ∣ 1 9 x − 1 9 3 ∣ − 1 9 − 1 9 − 1 9 − 1 9 ⋮ + 1 9 + 1 9 d x d ∣ 2 0 x − 2 0 3 ∣ − 2 0 − 2 0 − 2 0 − 2 0 ⋮ − 2 0 + 2 0 d x d f ( x ) − 2 1 0 − 2 0 8 − 2 0 4 − 1 9 8 ⋮ 1 7 0 2 1 0
Where f ′ ( x ) = d x d f ( x ) is the sum of the derivatives of all the absolute terms, which for n 2 ⩽ x < ( n + 1 ) 2 , 1 ⩽ n ⩽ 1 9 , can be computed with d x d f ( x ) = 2 i = 1 ∑ n i − i = 1 ∑ 2 0 i = n ( n + 1 ) − 2 1 0
Notice that
f
′
(
x
)
starts out at negative and increases at intervals as
x
increases, we can estimate that the shape of the graph of
f
(
x
)
looks something like this:
To find the minimum value of f ( x ) , our target is to make f ′ ( x ) as close to 0 as possible .
Turns out it's possible for f ′ ( x ) to be equal to 0, if we solve for f ′ ( x ) = 0 : n ( n + 1 ) − 2 1 0 = 0 n 2 + n − 2 1 0 = 0 ∴ n = 1 4 ( n > 0 )
Hence, 1 4 2 ⩽ x < 1 5 2 is when the minimum of f ( x ) occurs, when 1 4 ⩽ x < 1 5 : f ( x ) = ( x − 1 3 ) + ( 2 x − 2 3 ) + ( 3 x − 3 3 ) + … + ( 1 4 x − 1 4 3 ) − ( 1 5 x − 1 5 3 ) − … − ( 2 0 x − 2 0 3 ) = − 1 3 − 2 3 − 3 3 − … − 1 4 3 + 1 5 3 + … + 2 0 3 = [ 2 2 0 × 2 1 ] 2 − 2 [ 2 1 4 × 1 5 ] 2 = 2 2 0 5 0 (the x terms all cancel out since f ′ ( x ) = 0 ) ∴ 2 a 2 = 2 2 0 5 0 a = 1 0 5
Thanks for your detailed solution
@Kenneth Tan Isn't it 0 ≤ n ≤ 1 9 ?
Well but when n = 0 , we get f ′ ( x ) = 0 − 2 1 0 = − 2 1 0 . So I think it should be included too.
Log in to reply
Well it doesn't comply exactly since the condition is − ∞ ⩽ x < 1 not just 0 ⩽ x < 1 .
Problem Loading...
Note Loading...
Set Loading...
1 + 2 + 3 + . . . + 2 0 = 2 2 0 × 2 1 = 2 1 0
1 + 2 + 3 + . . . + 1 4 = 2 1 4 × 1 5 = 1 0 5
1 5 + 1 6 + 1 7 + . . . + 2 0 = 2 1 0 − 1 0 5 = 1 0 5
So, ( 1 + 2 + 3 + . . . + 1 4 ) − ( 1 5 + 1 6 + 1 7 + . . . + 2 0 ) = 0
The above calcution is useful indeed as by algebraic manipulation:
f ( x ) = ∣ x − 1 3 ∣ + ∣ 2 x − 2 3 ∣ + ∣ 3 x − 3 3 ∣ + . . . + ∣ 1 9 x − 1 9 3 ∣ + ∣ 2 0 x − 2 0 3 ∣ = ∣ x − 1 3 ∣ + ∣ 2 x − 2 3 ∣ + ∣ 3 x − 3 3 ∣ + . . . + ∣ 1 4 x − 1 4 3 ∣ + ∣ 1 5 3 − 1 5 x ∣ + . . . + ∣ 1 9 3 − 1 9 x ∣ + ∣ 2 0 3 − 2 0 x ∣ ≥ ∣ x − 1 3 + 2 x − 2 3 + 3 x − 3 3 + . . . + 1 4 x − 1 4 3 + 1 5 3 − 1 5 x + . . . + 1 9 3 − 1 9 x + 2 0 3 − 2 0 x ∣ = 0 + 2 0 3 + 1 9 3 + 1 8 3 + . . . + 1 5 3 − 1 4 3 − 1 3 3 − 1 2 3 − 2 3 − 1 3 = ( 2 0 3 + 1 9 3 + 1 8 3 + . . . + 2 3 + 1 3 ) − 2 × ( 1 4 3 + 1 3 3 + 1 2 3 + . . . + 2 3 + 1 3 ) = ( 2 2 0 × 2 1 ) 2 − 2 × ( 2 1 4 × 1 5 ) 2 = 2 1 0 2 − 2 × 1 0 5 2 = 2 2 × 1 0 5 2 − 2 × 1 0 5 2 = 2 × 1 0 5 2