Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Let $$f:[0,1] \rightarrow \mathbf{R}$$ be a twice differentiable function in $$(0,1)$$ such that $$f(0)=3$$ and $$f(1)=5$$. If the line $$y=2 x+3$$ intersects the graph of $$f$$ at only two distinct points in $$(0,1)$$, then the least number of points $$x \in(0,1)$$, at which $$f^{\prime \prime}(x)=0$$, is ____________.
Step 1: Set g(x)=f(x)-(2x+3). Then g(0)=g(1)=0, and the two distinct intersections in (0,1) give two additional distinct zeros of g there.
Step 2: The four distinct zeros of g in [0,1] imply, by Rolle's theorem on the three consecutive intervals, at least three distinct zeros of g'. Applying Rolle again between these gives at least two distinct zeros of g'' in (0,1).
Step 3: Since g''=f'', at least two points satisfy f''(x)=0. This lower bound is attainable, so the least number is 2.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.