Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2008 iTest Problems/Problem 60"

(Solution to Problem 60 (credit to official solution) -- Harmonic Triangle)
 
m
 
Line 42: Line 42:
 
<br>
 
<br>
 
From the two pieces of information, we find that the remainder when <math>S</math> is divided by <math>2008</math> is <math>\boxed{1944}.</math>
 
From the two pieces of information, we find that the remainder when <math>S</math> is divided by <math>2008</math> is <math>\boxed{1944}.</math>
−
 
+
===Note===
 +
The triangle in this problem is called [https://en.wikipedia.org/wiki/Leibniz_harmonic_triangle Lebiniz's Harmonic Triangle]
 
==See Also==
 
==See Also==
 
{{2008 iTest box|num-b=59|num-a=61}}
 
{{2008 iTest box|num-b=59|num-a=61}}

Latest revision as of 00:29, 2 November 2023

Problem

Consider the Harmonic Table \[\begin{array}{c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c@{\hspace{15pt}}c}&&&1&&&\\&&\tfrac12&&\tfrac12&&\\&\tfrac13&&\tfrac16&&\tfrac13&\\\tfrac14&&\tfrac1{12}&&\tfrac1{12}&&\tfrac14\\&&&\vdots&&&\end{array}\]

where $a_{n,1}=1/n$ and $a_{n,k+1}=a_{n-1,k}-a_{n,k}$.

Find the remainder when the sum of the reciprocals of the $2007$ terms on the $2007^\text{th}$ row gets divided by $2008$.

Solution

Notice that all the denominators have a common factor. If we factor the GCD of the few rows, the denominators seem to replicate the terms of Pascal's Triangle.


We claim that $a_{n,k} = \frac{1}{n \cdot \binom{n-1}{k-1}}.$ Plugging $k = 1$ results in $a_{n,1} = \frac{1}{n \cdot \binom{n-1}{0}} = \frac{1}{n}.$ Now we need to show that $a_{n,k+1}=a_{n-1,k}-a_{n,k}$ if $a_{n,k} = \frac{1}{n \cdot \binom{n-1}{k-1}}.$


If $a_{n,k} = \frac{1}{n \cdot \binom{n-1}{k-1}},$ then $a_{n-1,k} = \frac{1}{(n-1) \cdot \binom{n-2}{k-1}}.$ That means \begin{align*} a_{n-1,k} - a_{n,k} &= \frac{1}{(n-1) \cdot \binom{n-2}{k-1}} - \frac{1}{n \cdot \binom{n-1}{k-1}} \\ &= \frac{(n-k-1)!(k-1)!}{(n-1)(n-2)!} - \frac{(n-k)!(k-1)!}{n(n-1)!} \\ &= \frac{n(n-k-1)!(k-1)!}{n!} - \frac{(n-k)!(k-1)!}{n!} \\ &= \frac{(n-k-1)!(k-1)!(n - n + k)}{n!} \\ &= \frac{(n-k-1)!k!}{n(n-1)!} \\ &= \frac{1}{n \binom{n-1}{k}} \\ &= a_{n,k+1}. \end{align*}

Thus, $a_{n,k} = \frac{1}{n \cdot \binom{n-1}{k-1}}.$ We can use this to find the sum of the $2007$ terms in the $2007^\text{th}$ row. Let $S$ be the wanted sum.

\begin{align*} S &= \sum_{i=1}^{2007} \frac{1}{a_{2007,i}} \\ &= \sum_{i=1}^{2007} 2007 \cdot \binom{2006}{i-1} \\ &= 2007 \cdot 2^{2006} \end{align*}

Finally, to find the remainder when $S$ is divided by $2008,$ we need to use modular arithmetic. First, note that $2008 = 8 \cdot 251,$ so we can use the remainder when $S$ is divided by $8$ and $251$ to help us find the remainder when $S$ is divided by $2008$.


The remainder when $S$ is divided by $8$ is $0$ because the exponent of $2$ in $S$ is way over $8.$ By Fermat's Little Theorem, we know that $2^{251} \equiv 2 \pmod{251},$ and since $2$ is relatively prime to $251,$ $2^{250} \equiv 1 \pmod{251}.$ Thus, $2007 \cdot 2^{2006} \equiv -1 \cdot (2^{250})^8 \cdot 2^6 \equiv -64 \equiv 187 \pmod{251},$ so the remainder when $S$ is divided by $251$ is $187.$


From the two pieces of information, we find that the remainder when $S$ is divided by $2008$ is $\boxed{1944}.$

Note

The triangle in this problem is called Lebiniz's Harmonic Triangle

See Also

2008 iTest (Problems)
Preceded by:
Problem 59 		Followed by:
Problem 61
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 • 36 • 37 • 38 • 39 • 40 • 41 • 42 • 43 • 44 • 45 • 46 • 47 • 48 • 49 • 50 • 51 • 52 • 53 • 54 • 55 • 56 • 57 • 58 • 59 • 60 • 61 • 62 • 63 • 64 • 65 • 66 • 67 • 68 • 69 • 70 • 71 • 72 • 73 • 74 • 75 • 76 • 77 • 78 • 79 • 80 • 81 • 82 • 83 • 84 • 85 • 86 • 87 • 88 • 89 • 90 • 91 • 92 • 93 • 94 • 95 • 96 • 97 • 98 • 99 • 100
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2008_iTest_Problems/Problem_60&oldid=200625"