Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?
I want the old design back!!! :-)

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

(5 pont)

Deadline expired on October 15, 2008.


12 students sent a solution.
5 points:Bodor Bertalan, Éles András, Nagy 235 János, Nagy 314 Dániel, Nagy 648 Donát, Tomon István, Varga 171 László, Wolosz János.
4 points:Tossenberger Anna, Véges Márton.
3 points:1 student.
1 point:1 student.

Problems in Mathematics of KöMaL, September 2008