This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
If one solves the recurrence relation an+2=k1an+1+k0an for suitable constants k0,k1 such that it holds for all positive integers n, then it also holds for all real numbers n. Therefore, it makes no difference whether one considers the case n=0 in the solution; either way, the same constants will be obtained.
To see why this is the case, we note that if sinθ=257, with 0<θ<2π, then cosθ=2524. Then sin2θcos2θ=2sinθcosθ=625336,=1−2sin2θ=625527. Hence an+2=sinnθcos2θ+cosnθsin2θ=625527sinnθ+625336cosnθ. But we also have an+2=k1an+1+k0an=k1(sinnθcosθ+cosnθsinθ)+k0sinnθ=(k0+2524k1)sinnθ+257k1cosnθ. So if this recurrence is to be satisfied for positive integers n, then it is immediately obvious that it is also satisfied for arbitrary real n, since the equality of the coefficients gives identical equality. In particular, we must have k0+2524k1257k1=625527,=625336, the solution of which is k0=−1, k1=2548. Therefore, k0+k1=2523. However, we should note that if we were to approach the question by substituting in n=0, the resulting equation is underdetermined for k0. That doesn't mean the recurrence is false for this value; it simply means that k0 is not uniquely determined in that specific case.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
It does not, I couldn't solve it starting with n+2=2.
Try it without including it. It should've said it in the description, though. It took a lot of time for me to see that.
Log in to reply
Thanks
Note that your 'conclusion' is false.
You merely tried to find values which satisfy 1 of the many equations, and did not find a set of values which satisfied ALL of the equations.
Read the solution, which is similar to what Hero posted above.
Now that the question is closed, I can respond.
If one solves the recurrence relation an+2=k1an+1+k0an for suitable constants k0,k1 such that it holds for all positive integers n, then it also holds for all real numbers n. Therefore, it makes no difference whether one considers the case n=0 in the solution; either way, the same constants will be obtained.
To see why this is the case, we note that if sinθ=257, with 0<θ<2π, then cosθ=2524. Then sin2θcos2θ=2sinθcosθ=625336,=1−2sin2θ=625527. Hence an+2=sinnθcos2θ+cosnθsin2θ=625527sinnθ+625336cosnθ. But we also have an+2=k1an+1+k0an=k1(sinnθcosθ+cosnθsinθ)+k0sinnθ=(k0+2524k1)sinnθ+257k1cosnθ. So if this recurrence is to be satisfied for positive integers n, then it is immediately obvious that it is also satisfied for arbitrary real n, since the equality of the coefficients gives identical equality. In particular, we must have k0+2524k1257k1=625527,=625336, the solution of which is k0=−1, k1=2548. Therefore, k0+k1=2523. However, we should note that if we were to approach the question by substituting in n=0, the resulting equation is underdetermined for k0. That doesn't mean the recurrence is false for this value; it simply means that k0 is not uniquely determined in that specific case.