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.
Step 1: The equation at x=y=0 gives f(0)=0 or 1; f(0)=0 contradicts f(1/2)=−1, so f(0)=1. At x=y=1/2, f(1)=1.
Step 2: The recurrence f(n+1)+f(n−1)=2f(n)f(1) with f(0)=f(1)=1 gives f(k)=1 for every positive integer k.
Step 3: Using 1/[sin k sin(k+1)] = [cot k−cot(k+1)]/sin 1, the sum is (cot 1−cot 21)/sin 1 = cosec²1·cosec21·sin20, option C.
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.