Maths Olympiad Prep

Library / /463 of 520

Number theory Difficulty 7.3 National olympiad, round 2 Prove it

17. (SWE 1) Let α(n)\alpha(n) be the number of digits equal to one in the binary representation of a positive integer nn. Prove that: (a) the inequality α(n2)12α(n)(α(n)+1)\alpha\left(n^{2}\right) \leq \frac{1}{2} \alpha(n)(\alpha(n)+1) holds; (b) the above inequality is an equality for infinitely many positive integers; (c) there exists a sequence (ni)1\left(n_{i}\right)_{1}^{\infty} such that α(ni2)/α(ni)0\alpha\left(n_{i}^{2}\right) / \alpha\left(n_{i}\right) \rightarrow 0 as ii \rightarrow \infty. Alternative parts: Prove that there exists a sequence (ni)1\left(n_{i}\right)_{1}^{\infty} such that α(ni2)/α(ni)\alpha\left(n_{i}^{2}\right) / \alpha\left(n_{i}\right) tends to (d) \infty; (e) an arbitrary real number γ(0,1)\gamma \in(0,1); (f) an arbitrary real number γ0\gamma \geq 0.

Solution

17. (a) Let n=i=1k2ain=\sum_{i=1}^{k} 2^{a_{i}}, so that α(n)=k\alpha(n)=k. Then n2=i22ai+i<j2ai+aj. n^{2}=\sum_{i} 2^{2 a_{i}}+\sum_{i<j} 2^{a_{i}+a_{j}}. It is easy to see that α(n2)α(n)\alpha(n^2) \geq \alpha(n). For n=2an=2^a, we have α(n2)=α(n)=1\alpha(n^2) = \alpha(n) = 1. For n=2a+2bn=2^a + 2^b with a>ba > b, we have α(n2)=α(n)+1\alpha(n^2) = \alpha(n) + 1. For n=2a+2b+2cn=2^a + 2^b + 2^c with a>b>ca > b > c, we have α(n2)=α(n)+2\alpha(n^2) = \alpha(n) + 2. In general, for n=i=1k2ain=\sum_{i=1}^{k} 2^{a_{i}} with a1>a2>>aka_1 > a_2 > \cdots > a_k, we have α(n2)=α(n)+(k1)\alpha(n^2) = \alpha(n) + (k-1).

(b) For m1m \geq 1, let nm=i=02m12i(i+1)/2n_{m}=\sum_{i=0}^{2^{m}-1} 2^{i(i+1) / 2}. It is easy to see that α(nm)=2mm\alpha(n_{m})=2^{m}-m. On the other hand, squaring and simplifying yields nm2=1+i=02m22i(i+3)/2n_{m}^{2}=1+\sum_{i=0}^{2^{m}-2} 2^{i(i+3) / 2}. Therefore, α(nm2)=2mm+1\alpha(n_{m}^{2})=2^{m}-m+1. It follows that limmα(nm2)α(nm)=limm2mm+12mm=1. \lim _{m \rightarrow \infty} \frac{\alpha(n_{m}^{2})}{\alpha(n_{m})}=\lim _{m \rightarrow \infty} \frac{2^{m}-m+1}{2^{m}-m}=1.

(c) Let γ[0,1]\gamma \in [0,1] be a constant to be chosen later, and let Ni=2mini1N_{i}=2^{m_{i}} n_{i}-1 where mi>α(ni)m_{i}>\alpha(n_{i}) is such that mi/α(ni)θm_{i} / \alpha(n_{i}) \rightarrow \theta as ii \rightarrow \infty. Then α(Ni)=α(ni)+mi1\alpha(N_{i})=\alpha(n_{i})+m_{i}-1, whereas Ni2=22mini22mi+1ni+1N_{i}^{2}=2^{2 m_{i}} n_{i}^{2}-2^{m_{i}+1} n_{i}+1 and α(Ni2)=α(ni2)α(ni)+mi\alpha(N_{i}^{2})=\alpha(n_{i}^{2})-\alpha(n_{i})+m_{i}. It follows that limiα(Ni2)α(Ni)=limiα(ni2)+(θ1)α(ni)(1+θ)α(ni)=θ1θ+1 \lim _{i \rightarrow \infty} \frac{\alpha(N_{i}^{2})}{\alpha(N_{i})}=\lim _{i \rightarrow \infty} \frac{\alpha(n_{i}^{2})+(\theta-1) \alpha(n_{i})}{(1+\theta) \alpha(n_{i})}=\frac{\theta-1}{\theta+1} which is equal to γ[0,1]\gamma \in[0,1] for θ=1+γ1γ\theta=\frac{1+\gamma}{1-\gamma} (for γ=1\gamma=1 we set mi/α(ni)m_{i} / \alpha(n_{i}) \rightarrow \infty).

(d) Let be given a sequence (ni)i=1\left(n_{i}\right)_{i=1}^{\infty} with α(ni2)/α(ni)γ\alpha(n_{i}^{2}) / \alpha(n_{i}) \rightarrow \gamma. Taking mi>α(ni)m_{i}>\alpha(n_{i}) and Ni=2mini+1N_{i}=2^{m_{i}} n_{i}+1 we easily find that α(Ni)=α(ni)+1\alpha(N_{i})=\alpha(n_{i})+1 and α(Ni2)=α(ni2)+α(ni)+1\alpha(N_{i}^{2})=\alpha(n_{i}^{2})+\alpha(n_{i})+1. Hence α(Ni2)/α(Ni)=γ+1\alpha(N_{i}^{2}) / \alpha(N_{i})=\gamma+1. Continuing this procedure we can construct a sequence tit_{i} such that α(ti2)/α(ti)=γ+k\alpha(t_{i}^{2}) / \alpha(t_{i})=\gamma+k for an arbitrary kNk \in \mathbb{N}.

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.