tmua.me papers

tmua.me Extreme Set B Paper 2 · Q9

Paper 2Logic & proofFunctions & graphsNumber & counting

A real-valued function ff, defined for every real number, satisfies

f(x+1)=f(x)+2x+1,f(2x)=4f(x)f(x+1)=f(x)+2x+1,\qquad f(2x)=4f(x)

for every real xx. Also, 0≤f(x)≤10\leq f(x)\leq1 whenever 0≤x≤10\leq x\leq1.

A student wishes to prove that f(x)=x2f(x)=x^2 for every real xx. The student puts g(x)=f(x)−x2g(x)=f(x)-x^2 and correctly obtains

g(x+1)=g(x),g(2x)=4g(x),∣g(x)∣≤1 when 0≤x≤1.g(x+1)=g(x),\qquad g(2x)=4g(x),\qquad |g(x)|\leq1\ \text{when }0\leq x\leq1.

For a fixed real xx and each positive integer nn, the student chooses an integer knk_n such that

0≤2nx−kn<1.0\leq2^n x-k_n<1.

Which of the following validly completes the proof, without assuming that ff or gg is continuous?

ASince gg has period 11, g(2nx)=g(x)g(2^n x)=g(x). Combining this with g(2nx)=4ng(x)g(2^n x)=4^n g(x) gives g(x)=0g(x)=0.
BThe bound on ff gives ∣4nf(x)−kn2∣≤1|4^n f(x)-k_n^2|\leq1. Dividing by 4n4^n and letting nn increase gives f(x)=x2f(x)=x^2.
COne integer kk can be chosen so that 0≤2nx−k<10\leq2^n x-k<1 for every nn. Thus gg is bounded on the sequence 2nx2^n x, forcing g(x)=0g(x)=0.
DRepeated scaling gives g(x)=4−ng(x/2n)g(x)=4^{-n}g(x/2^n). Since x/2nx/2^n approaches 00, the bound on gg gives g(x)=0g(x)=0.
EInteger translations give g(2nx−kn)=g(2nx)=4ng(x)g(2^n x-k_n)=g(2^n x)=4^n g(x). Hence ∣g(x)∣≤4−n|g(x)|\leq4^{-n} for every positive integer nn, so g(x)=0g(x)=0.
FThe numbers 2nx−kn2^n x-k_n lie between 00 and 11, so they approach 00 as nn increases. Therefore g(2nx−kn)g(2^n x-k_n) approaches g(0)=0g(0)=0, forcing g(x)=0g(x)=0.

Read the questions freely. Sign in to check your answer, see the worked solution and save your progress.