Processing math: 100%

User Tools

Site Tools


pow:problem5f23

Problem 5 (due Monday, November 6)

Let (fn) be the Fibonacci sequence: f1=f2=1, fn=fn1+fn2 for all n>2. Prove that for every odd n3 the polynomial   xn+fnx2fn2   is divisible by x2+x1.

Each of the submitted solutions is similar to one of our four in-house solutions. For details see the following link Solution.

pow/problem5f23.txt · Last modified: 2023/11/15 13:29 by mazur