Difference between revisions of "Mock AIME 1 2007-2008 Problems/Problem 6"
Hypervizerx (talk | contribs) (→Problem 6) |
Hypervizerx (talk | contribs) (→Problem 6) |
||
Line 2: | Line 2: | ||
A <math>\frac 1p</math> -array is a structured, infinite, collection of numbers. For example, a <math>\frac 13</math> -array is constructed as follows: | A <math>\frac 1p</math> -array is a structured, infinite, collection of numbers. For example, a <math>\frac 13</math> -array is constructed as follows: | ||
− | < | + | <cmath>\begin{align*} |
1 \qquad \frac 13\,\ \qquad \frac 19\,\ \qquad \frac 1{27} \qquad &\cdots\\ | 1 \qquad \frac 13\,\ \qquad \frac 19\,\ \qquad \frac 1{27} \qquad &\cdots\\ | ||
\frac 16 \qquad \frac 1{18}\,\ \qquad \frac{1}{54} \qquad &\cdots\\ | \frac 16 \qquad \frac 1{18}\,\ \qquad \frac{1}{54} \qquad &\cdots\\ | ||
Line 8: | Line 8: | ||
\frac 1{216} \qquad &\cdots\\ | \frac 1{216} \qquad &\cdots\\ | ||
&\ddots | &\ddots | ||
− | \end{align*}</ | + | \end{align*}</cmath> |
In general, the first entry of each row is <math>\frac{1}{2p}</math> times the first entry of the previous row. Then, each succeeding term in a row is <math>\frac 1p</math> times the previous term in the same row. If the sum of all the terms in a <math>\frac{1}{2008}</math> -array can be written in the form <math>\frac mn</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers, find the remainder when <math>m+n</math> is divided by <math>2008</math>. | In general, the first entry of each row is <math>\frac{1}{2p}</math> times the first entry of the previous row. Then, each succeeding term in a row is <math>\frac 1p</math> times the previous term in the same row. If the sum of all the terms in a <math>\frac{1}{2008}</math> -array can be written in the form <math>\frac mn</math>, where <math>m</math> and <math>n</math> are relatively prime positive integers, find the remainder when <math>m+n</math> is divided by <math>2008</math>. |
Revision as of 18:14, 29 January 2020
Problem 6
A -array is a structured, infinite, collection of numbers. For example, a -array is constructed as follows:
In general, the first entry of each row is times the first entry of the previous row. Then, each succeeding term in a row is times the previous term in the same row. If the sum of all the terms in a -array can be written in the form , where and are relatively prime positive integers, find the remainder when is divided by .
Solution
Note that the value in the th row and the th column is given by . We wish to evaluate the summation over all , and so the summation will be, using the formula for an infinite geometric series:
&= \left(\frac{1}{1-\frac{1}{2p}}\right)\left(\frac{1}{1-\frac{1}{p}}\right)\\
&= \frac{2p^2}{(2p-1)(p-1)}\end{align*}$ (Error compiling LaTeX. Unknown error_msg)Taking the denominator with (indeed, the answer is independent of the value of ), we have (or consider FOILing). The answer is .
With less notation, the above solution is equivalent to considering the product of the geometric series . Note that when we expand this product, the terms cover all of the elements of the array.
By the geometric series formula, the first series evaluates to be . The second series evaluates to be . Their product is , from which we find that leaves a residue of upon division by .
See also
Mock AIME 1 2007-2008 (Problems, Source) | ||
Preceded by Problem 5 |
Followed by Problem 7 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |