Difference between revisions of "1966 AHSME Problems/Problem 36"
Shurong.ge (talk | contribs) (→Solution 2) |
m (→Solution 1) |
||
| Line 11: | Line 11: | ||
Adding yields | Adding yields | ||
<cmath>f(1)+f(-1)=2(a_0+a_2+a_4+...+a_{2n})=3^n+1</cmath> | <cmath>f(1)+f(-1)=2(a_0+a_2+a_4+...+a_{2n})=3^n+1</cmath> | ||
| − | Thus <math>s=\frac{3^n+1}{2}</math>, or <math>\boxed{ | + | Thus <math>s=\frac{3^n+1}{2}</math>, or <math>\boxed{E}</math>. |
~ Nafer | ~ Nafer | ||
| + | |||
| + | ~ Minor edits by Qinglang, Nafer wrote a great solution, but put D instead of E | ||
== See also == | == See also == | ||
Revision as of 01:26, 3 July 2021
Problem
Let 
be an identity in 
. If we let 
, then 
equals:
Solution 1
Let 
then we have
![\[f(1)=a_0+a_1+a_2+...+a_{2n}=(1+1+1)^n=3^n\]](http://latex.artofproblemsolving.com/5/6/7/5671c2d825943ceb3af8d69944ac957d27b9e5da.png)
![\[f(-1)=a_0-a_1+a_2-...+a_{2n}=(1-1+1)^n=1\]](http://latex.artofproblemsolving.com/7/c/1/7c14a7e9fcc8e6f137e822943a21873a823defba.png)
Adding yields
![\[f(1)+f(-1)=2(a_0+a_2+a_4+...+a_{2n})=3^n+1\]](http://latex.artofproblemsolving.com/8/0/3/8031c910f342615fdcf03b63c9d5e177acd7181e.png)
Thus 
, or 
.
~ Nafer
~ Minor edits by Qinglang, Nafer wrote a great solution, but put D instead of E
See also
| 1966 AHSME (Problems • Answer Key • Resources) | ||
| Preceded by Problem 35 |
Followed by Problem 37 | |
| 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 | ||
| All AHSME Problems and Solutions | ||
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 
