Difference between revisions of "1970 AHSME Problems/Problem 16"
m (→See also) |
Claudeaops (talk | contribs) (→Solution) |
||
Line 10: | Line 10: | ||
\text{(E) } 26</math> | \text{(E) } 26</math> | ||
− | == Solution | + | == Solution = |
− | <math>\fbox{C}</math> | + | We can chug through the recursion to find the answer is <math>\fbox{C}</math>. |
+ | |||
+ | ==Sidenote== | ||
+ | All the numbers in the sequence <math>F(n)</math> are integers. In fact, the function <math>F</math> satisfies <math>F(n)=4F(n-2)-F(n-4)</math>. (Prove it!). | ||
== See also == | == See also == |
Revision as of 00:01, 25 May 2015
Contents
[hide]Problem
If is a function such that , and such that for then
= Solution
We can chug through the recursion to find the answer is .
Sidenote
All the numbers in the sequence are integers. In fact, the function satisfies . (Prove it!).
See also
1970 AHSC (Problems • Answer Key • Resources) | ||
Preceded by Problem 15 |
Followed by Problem 17 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 • 31 • 32 • 33 • 34 • 35 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.