Let be given the sequence (xn) defined by x1=1 and xn+1=3xn+⌊xn5⌋ for all n=1,2,3,…, where ⌊x⌋ denotes the greatest integer that does not exceed x. Prove that for any positive integer n we have xnxn+2−xn+12=4n−1
Solution
It is easy to prove by induction that xn is an integer for all n≥1. Therefore, we have xn+1=⌊(3+5)xn⌋ for all n≥1, and we deduce that xn+2=⌊(3+5)xn+1⌋=6xn+1+⌊−(3−5)⌊(3+5)xn⌋⌋=6xn+1+⌊−4(3+5)⌊(3+5)xn⌋⌋=6xn+1−4xn Indeed, for the last equality we have (3+5)xn−1<⌊(3+5)xn⌋≤(3+5)xn, from which we deduce −4xn≤−4(3+5)⌊(3+5)xn⌋<−4xn+3+54<−4xn+1. Let yn=xnxn+2−xn+12, for all n≥1. We will prove by induction that yn=4n−1, for all n≥1. For n=1, we have x1=1,x2=⌊(3+5)⌋=5 and x3=⌊5(3+5)⌋=26, and therefore y1=40. Assume yn=4n−1 for some positive integer n. We have yn+1=xn+1xn+3−xn+22=xn+1(6xn+2−4xn+1)−xn+2(6xn+1−4xn)=4yn=4n This ends the induction and solves the problem.
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.