Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help


Fibonacci divisibility and gcd laws

Verified locator

Thomas Jeffery and Rajesh Pereira, Divisibility Properties of the Fibonacci, Lucas, and Related Sequences, ISRN Algebra 2014, Article 750325, pages 1–5, DOI 10.1155/2014/750325.

Claim and scope

Proposition 6 states F_a | F_am for positive integers a and m. Theorem 7 states gcd(F_a,F_b)=F_gcd(a,b). Proposition 6 alone implies that, for each positive a and integer divisor d, divisibility of every F_am by d is equivalent to divisibility of F_a by d: one direction uses m=1, and the other uses transitivity.