Difference between revisions of "2002 AMC 12P Problems/Problem 11"
(→See also) |
(→Problem) |
||
Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
− | + | Let <math>t_n = \frac{n(n+1)}{2}</math> be the <math>n</math>th triangular number. Find | |
− | <math> \ | + | <cmath>\frac{1}{t_1} + \frac{1}{t_2} + \frac{1}{t_3} + ... + \frac{1}{t_2002}</cmath> |
+ | |||
+ | <math> | ||
+ | \text{(A) }\frac {4003}{2003} | ||
+ | \qquad | ||
+ | \text{(B) }\frac {2001}{1001} | ||
+ | \qquad | ||
+ | \text{(C) }\frac {4004}{2003} | ||
+ | \qquad | ||
+ | \text{(D) }\frac {4001}{2001} | ||
+ | \qquad | ||
+ | \text{(E) }2 | ||
+ | </math> | ||
== Solution == | == Solution == |
Revision as of 23:47, 29 December 2023
Problem
Let be the th triangular number. Find
Solution
If , then . Since , must be to some factor of 6. Thus, there are four (3, 9, 27, 729) possible values of .
See also
2002 AMC 12P (Problems • Answer Key • Resources) | |
Preceded by Problem 10 |
Followed by Problem 12 |
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 | |
All AMC 12 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.