Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2015 / Problems / Day 1, P3

IMC 2015 · Day 1 · P3

medium

Let F(0)=0F(0) = 0, F(1)=32F(1) = \frac{3}{2}, and F(n)=52F(n1)F(n2)F(n) = \frac{5}{2} F(n-1) - F(n-2) for n2n \ge 2.

Determine whether or not n=01F(2n)\displaystyle\sum_{n=0}^{\infty} \frac{1}{F(2^n)} is a rational number.

(Proposed by Gerhard Woeginger, Eindhoven University of Technology)

Solution 1 of 2 (official)

The characteristic equation of our linear recurrence is x252x+1=0x^2 - \frac{5}{2} x + 1 = 0, with roots x1=2x_1 = 2 and x2=12x_2 = \frac{1}{2}. So F(n)=a2n+b(12)nF(n) = a \cdot 2^n + b \cdot \left(\frac{1}{2}\right)^n with some constants a,ba, b. By F(0)=0F(0) = 0 and F(1)=32F(1) = \frac{3}{2}, these constants satisfy a+b=0a + b = 0 and 2a+b2=322a + \frac{b}{2} = \frac{3}{2}. So a=1a = 1 and b=1b = -1, and therefore F(n)=2n2n.F(n) = 2^n - 2^{-n}. Observe that 1F(2n)=22n(22n)21=122n11(22n)21=122n1122n+11,\frac{1}{F(2^n)} = \frac{2^{2^n}}{(2^{2^n})^2 - 1} = \frac{1}{2^{2^n} - 1} - \frac{1}{(2^{2^n})^2 - 1} = \frac{1}{2^{2^n} - 1} - \frac{1}{2^{2^{n+1}} - 1}, so n=01F(2n)=n=0(122n1122n+11)=12201=1.\sum_{n=0}^{\infty} \frac{1}{F(2^n)} = \sum_{n=0}^{\infty} \left( \frac{1}{2^{2^n} - 1} - \frac{1}{2^{2^{n+1}} - 1} \right) = \frac{1}{2^{2^0} - 1} = 1. Hence the sum takes the value 1, which is rational.

Solution 2 of 2 (official)

As in the first solution we find that F(n)=2n2nF(n) = 2^n - 2^{-n}. Then n=01F(2n)=n=0122n22n=n=0(12)2n1(12)2n+1=n=0(12)2nk=0((12)2n+1)k=n=0(12)2nk=0(12)2k2n=n=0k=0(12)2n(2k+1)=m=1(12)m=1.\begin{align*} \sum_{n=0}^{\infty} \frac{1}{F(2^n)} &= \sum_{n=0}^{\infty} \frac{1}{2^{2^n} - 2^{-2^n}} = \sum_{n=0}^{\infty} \frac{\left(\frac12\right)^{2^n}} {1 - \left(\frac12\right)^{2^{n+1}}} \\ &= \sum_{n=0}^{\infty} \left(\tfrac12\right)^{2^n} \sum_{k=0}^{\infty} \left( \left(\tfrac12\right)^{2^{n+1}} \right)^k = \sum_{n=0}^{\infty} \left(\tfrac12\right)^{2^n} \sum_{k=0}^{\infty} \left(\tfrac12\right)^{2k \cdot 2^n} \\ &= \sum_{n=0}^{\infty} \sum_{k=0}^{\infty} \left(\tfrac12\right)^{2^n (2k+1)} = \sum_{m=1}^{\infty} \left(\tfrac12\right)^{m} = 1. \end{align*} (Here we used the fact that every positive integer mm has a unique representation m=2n(2k+1)m = 2^n (2k+1) with non-negative integers nn and kk.)

This shows that the series converges to 1.

How the field did

contestants scored
318
average (of 10)
4.89
solved (≥ 80%)
41.2%
near-0 (≤ 10%)
27.7%
discrimination
0.53

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2002 · Day 2 · P9easyavg 5.6/10 · solved 51% · near-0 38% · disc 0.48
IMC 2019 · Day 2 · P7easyavg 7.8/10 · solved 73% · near-0 15% · disc 0.43
IMC 2019 · Day 1 · P4killeravg 0.4/10 · solved 2% · near-0 92% · disc 0.33
IMC 2018 · Day 2 · P10killeravg 0.3/10 · solved 1% · near-0 96% · disc 0.37