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
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
Math
Appears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3
2×3
2^{34}
234
a_{i-1}
ai−1
\frac{2}{3}
32
\sqrt{2}
2
\sum_{i=1}^3
∑i=13
\sin \theta
sinθ
\boxed{123}
123
Comments
Note that given x2k+x2k1=n then x2k+1+x2k+11=(x2k+x2k1)2−2=n2−2
Thus we can define a sequence {ak} to be a0=3 and an+1=an2−2 which will give us ak=x2k+x2k1
We want to find the last two digits of a2013. Note that when k≥1, the units digit of ak is 7, so brute force calculation of the period of this recursion won't be that bad:
a0≡3(mod100)a1≡7(mod100)a2≡47(mod100)a3≡7(mod100)⋮
And thus we see that the last two digits of ak are periodic with period 2. It remains to find the last two digits of a2013, which we see is clearly 7.
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
Note that given x2k+x2k1=n then x2k+1+x2k+11=(x2k+x2k1)2−2=n2−2
Thus we can define a sequence {ak} to be a0=3 and an+1=an2−2 which will give us ak=x2k+x2k1
We want to find the last two digits of a2013. Note that when k≥1, the units digit of ak is 7, so brute force calculation of the period of this recursion won't be that bad: a0≡3(mod100) a1≡7(mod100) a2≡47(mod100) a3≡7(mod100) ⋮
And thus we see that the last two digits of ak are periodic with period 2. It remains to find the last two digits of a2013, which we see is clearly 7.
Log in to reply
Actually, a0=3 and a1=7, so a2013≡7(mod100). Also, is it possible to find an explicit formula for the sequence?
Log in to reply
Thanks for the correction.
As for an explicit formula, just note that x+x1=3⟺x2−3x+1=0⟺x=23±5
Thus, we have an=x2n+x2n1=(23+5)2n+(23+5)2n1
Log in to reply
47
hmm i did the same . Answer is 47.
Isn't this one of your problems :\
Log in to reply
Indeed. Thanks for your observation.