Problem A. 459. (September 2008)
A. 459. Denote by Fn the nth Fibonacci number (F0=0, F1=1, Fk+1=Fk+Fk-1). Show that one can find a positive integer n, having at least 1000 distinct prime divisors, such that n divides Fn.
Proposed by: Péter Csikvári, Budapest
Deadline expired on 15 October 2008.