Piecewise Functions - 3

Calculus Level 5

Let a function f : R R f : \mathbb{R} \rightarrow \mathbb{R} be defined as:

f ( x ) = { sin x , if a < x b x c d , if x a or x > b . f(x) = \begin{cases} \sin x, & \text{if } a < x \leq b \\ |x - c | - d, & \text{if } x \leq a \text{ or } x > b. \end{cases}

It is given:

  • a , b , c , d a, b, c, d are real numbers
  • f f is a differentiable function for all real values of x x

Find the minimum possible value of a + b + c + d \lvert \lfloor a + b + c + d \rfloor \rvert .

Details and assumptions

\lfloor \cdot \rfloor is the floor function


This problem is part of the set - Piecewise-defined Functions


The answer is 3.

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.

1 solution

Pranshu Gaba
Oct 16, 2014

First of all, since x c d |x- c| -d is a piecewise function as well, we must explicitly define it.

x c d = { x + c d x < c x ( c + d ) x c |x - c| - d = \begin{cases} -x + c - d& x < c \\ x - (c+d) & x \geq c \end{cases}

Its graph is V \text{V} shaped, and the coordinates of the vertex are ( c , d ) (c, -d) .

sin x \sin x is always differentiable in its domain, but x c d |x- c| -d has one point of non-differentiabilty at its vertex, x = c x =c . To make f f differentiable, c c must lie between a a and b b .

At a a and b b , f f will be differentiable only if left derivative is equal to right derivative.


At a a :

Left derivative = cos a = \cos a . Right derivative = 1 = -1 .

cos a = 1 \implies \cos a = -1

a = ( 2 k + 1 ) π \implies a = (2k + 1) \pi , where k Z k \in \mathbb{Z}

Similarly, at b b :

Left derivative = 1 = -1 . Right derivative = cos b = \cos b

cos b = 1 \implies \cos b = 1

b = 2 n π \implies b = 2n \pi , where n Z n \in \mathbb{Z}

Observe sin a \sin a and sin b \sin b are both 0 0 , so f ( a ) f(a) and f ( b ) f(b) are both 0 0 .


Since ( b , 0 ) (b, 0) satisfies f ( x ) = x ( c + d ) f(x) = x - (c+d)

0 = b ( c + d ) \implies 0 = b - ( c + d)

b = c + d \implies b = c + d

Thus, the required expression a + b + c + d = a + b + b \lvert \lfloor a + b + c + d \rfloor\rvert = \lvert \lfloor a + b + b \rfloor \rvert

= a + 2 b = \lvert \lfloor a + 2b\rfloor \rvert

= ( 2 k + 1 + 4 n ) π = \lvert \lfloor (2k+1 + 4n) \pi \rfloor \rvert


Since ( 2 k + 1 + 4 n ) π \lvert \lfloor (2k+1 + 4n) \pi \rfloor \rvert must be made minimum,

( 2 k + 1 + 4 n ) π \implies \lfloor (2k+1 + 4n) \pi \rfloor must be closest to 0 0 .

Note: We have a condition a < b a < b

( 2 k + 1 ) < 2 n k < n \implies (2k+1 ) < 2n \implies k < n .

On observation, we see that for n = 1 n= 1 , k = 2 k = -2 , the above expression is closest to 0 0

After substituting these values, we get

( 2 × ( 2 ) + 1 + 4 × 1 ) π = π = 3 = 3 \lvert \lfloor (2 \times (-2) +1 + 4 \times 1) \pi \rfloor \rvert = \lvert \lfloor \pi \rfloor \rvert = \lvert 3 \rvert = 3

Therefore the minimum value of a + b + c + d = 3 \lvert \lfloor a + b+ c + d \rfloor \rvert = \boxed{3}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...