Let a function be defined as:
It is given:
Find the minimum possible value of .
Details and assumptions
is the floor function
This problem is part of the set - Piecewise-defined Functions
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.
First of all, since ∣ x − c ∣ − d is a piecewise function as well, we must explicitly define it.
∣ x − c ∣ − d = { − x + c − d x − ( c + d ) x < c x ≥ c
Its graph is V shaped, and the coordinates of the vertex are ( c , − d ) .
sin x is always differentiable in its domain, but ∣ x − c ∣ − d has one point of non-differentiabilty at its vertex, x = c . To make f differentiable, c must lie between a and b .
At a and b , f will be differentiable only if left derivative is equal to right derivative.
At a :
Left derivative = cos a . Right derivative = − 1 .
⟹ cos a = − 1
⟹ a = ( 2 k + 1 ) π , where k ∈ Z
Similarly, at b :
Left derivative = − 1 . Right derivative = cos b
⟹ cos b = 1
⟹ b = 2 n π , where n ∈ Z
Observe sin a and sin b are both 0 , so f ( a ) and f ( b ) are both 0 .
Since ( b , 0 ) satisfies f ( x ) = x − ( c + d )
⟹ 0 = b − ( c + d )
⟹ b = c + d
Thus, the required expression ∣ ⌊ a + b + c + d ⌋ ∣ = ∣ ⌊ a + b + b ⌋ ∣
= ∣ ⌊ a + 2 b ⌋ ∣
= ∣ ⌊ ( 2 k + 1 + 4 n ) π ⌋ ∣
Since ∣ ⌊ ( 2 k + 1 + 4 n ) π ⌋ ∣ must be made minimum,
⟹ ⌊ ( 2 k + 1 + 4 n ) π ⌋ must be closest to 0 .
Note: We have a condition a < b
⟹ ( 2 k + 1 ) < 2 n ⟹ k < n .
On observation, we see that for n = 1 , k = − 2 , the above expression is closest to 0
After substituting these values, we get
∣ ⌊ ( 2 × ( − 2 ) + 1 + 4 × 1 ) π ⌋ ∣ = ∣ ⌊ π ⌋ ∣ = ∣ 3 ∣ = 3
Therefore the minimum value of ∣ ⌊ a + b + c + d ⌋ ∣ = 3