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

IMC / 1994 / Problems / Day 1, P6

IMC 1994 · Day 1 · P6

Let fC2[0,N]f \in C^2[0,N] and f(x)<1|f'(x)| < 1, f(x)>0f''(x) > 0 for every x[0,N]x \in [0,N]. Let 0m0<m1<<mkN0 \le m_0 < m_1 < \cdots < m_k \le N be integers such that ni=f(mi)n_i = f(m_i) are also integers for i=0,1,,ki = 0,1,\dots,k. Denote bi=nini1b_i = n_i - n_{i-1} and ai=mimi1a_i = m_i - m_{i-1} for i=1,2,,ki = 1,2,\dots,k.

a) Prove that 1<b1a1<b2a2<<bkak<1.-1 < \frac{b_1}{a_1} < \frac{b_2}{a_2} < \cdots < \frac{b_k}{a_k} < 1.

b) Prove that for every choice of A>1A > 1 there are no more than N/AN/A indices jj such that aj>Aa_j > A.

c) Prove that k3N2/3k \le 3 N^{2/3} (i.e. there are no more than 3N2/33 N^{2/3} integer points on the curve y=f(x)y = f(x), x[0,N]x \in [0,N]).

Solution (official)

a) For i=1,2,,ki = 1,2,\dots,k we have bi=f(mi)f(mi1)=(mimi1)f(xi)b_i = f(m_i) - f(m_{i-1}) = (m_i - m_{i-1}) f'(x_i) for some xi(mi1,mi)x_i \in (m_{i-1}, m_i). Hence biai=f(xi)\frac{b_i}{a_i} = f'(x_i) and so 1<biai<1-1 < \frac{b_i}{a_i} < 1. From the convexity of ff we have that ff' is increasing and biai=f(xi)<f(xi+1)=bi+1ai+1\frac{b_i}{a_i} = f'(x_i) < f'(x_{i+1}) = \frac{b_{i+1}}{a_{i+1}} because of xi<mi<xi+1x_i < m_i < x_{i+1}.

b) Set SA={j{0,1,,k}:aj>A}S_A = \{ j \in \{0,1,\dots,k\} : a_j > A \}. Then Nmkm0=i=1kaijSAaj>ASAN \ge m_k - m_0 = \sum_{i=1}^{k} a_i \ge \sum_{j \in S_A} a_j > A |S_A| and hence SA<N/A|S_A| < N/A.

c) All different fractions in (1,1)(-1,1) with denominators less or equal AA are no more 2A22A^2. Using b) we get k<N/A+2A2k < N/A + 2A^2. Put A=N1/3A = N^{1/3} in the above estimate and get k<3N2/3k < 3 N^{2/3}.

Similar problems