Maths Olympiad Prep

Library / /12 of 15

Number theory Difficulty 6.5 National olympiad Prove it Bulgaria

For every positive integer nn set an=0a_n = 0, if the number of divisors of nn, greater than 20072007, is even and an=1a_n = 1, if this number is odd. Is the number α=0,a1a2a3ak\alpha = 0, a_1a_2a_3 \dots a_k \dots rational?

Solution

We prove that α\alpha is irrational. Suppose α\alpha is a rational number, i.e. the sequence a1,a2,a3,,ak,a_1, a_2, a_3, \ldots, a_k, \ldots is periodic from some point onwards. Hence there exist k0k_0 and TT such that for any k>k0k > k_0 we have ak=ak+Ta_k = a_{k+T}.

Choose a positive integer mm for which mT>k0mT > k_0 and mTmT is a perfect square. If T=p1α1p2α2psαsT = p_1^{\alpha_1} p_2^{\alpha_2} \cdots p_s^{\alpha_s} then m=p1β1p2β2psβsm = p_1^{\beta_1} p_2^{\beta_2} \cdots p_s^{\beta_s}, where αi+βi\alpha_i + \beta_i is even for all i=1,2,,si = 1, 2, \ldots, s and βi\beta_i are large enough positive integers.

Choose a prime number p>2007p > 2007, ppip \neq p_i, i=1,2,,si = 1, 2, \ldots, s. Since pmTmTpmT - mT is divisible by TT we have that amT=apmTa_{mT} = a_{pmT}.

Denote by τ(k)\tau(k) the number of divisors of kk and by f(k)f(k) the number of divisors of kk that are greater than 20072007. We have f(pmT)=f(mT)+τ(mT)f(pmT) = f(mT) + \tau(mT) and since τ(mT)\tau(mT) is odd number we conclude that f(pmT)f(pmT) and f(mT)f(mT) are of the same parity, a contradiction.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.