Let z be a complex number and k a positive integer such that zk is a positive real number other than 1. Let f(n) denote the real part of the complex number zn. Assume the parabola p(n)=an2+bn+c intersects f(n) four times, at n=0,1,2,3. Assuming the smallest possible value of k, find the largest possible value of a.
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
Let r=∣z∣,θ=argz, and C=∣z∣ℜz=cosθ=cosk2πj for some j with gcd(j,k)=1. The condition of the four consecutive points lying on a parabola is equivalent to having the finite difference f(3)−3f(2)+3f(1)−f(0)=0 This implies f(3)−f(0)⟺r3cos(3θ)−1⟺r3(4C3−3C)−1=3[f(2)−f(1)]=3(r2cos(2θ)−rcos(θ))=3(r2(2C2−1)−rC). Now we simply test the first few possible values of k. k=1 implies C=1, which gives r3−1=3(r2−r)⟹(r−1)3=0⟹r=1. This is not allowed since r=1 implies a periodic function. k=2 implies C=−1, which gives −r3−1=3r2+r⟹(r+1)3=0, again not allowed since r>0. k=3 implies C=−21. This gives r3−1=2−3(r2−r)⟹(r−1)(r+21)(r+2)=0. These roots are either negative or 1, again not allowed. k=4 implies C=0. This gives −1=−3r2⟹r=±31⋅r=31 is allowed, so this will generate our answer. Again by finite differences (or by any other method of interpolating with a quadratic), we get 2a=f(0)+f(2)−2f(1)=32, so a=31.
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: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.