On the greatest prime factor of binary recurrence sequences
by Ling Kei Hung
vi, 34 leaves ; 30 cm
By utilizing the very recent work of Yu [Y3] on linear forms in padic logarithms of algebraic numbers, this thesis establishes a sharp effective lower bound for the greatest prime factor of binary recurrence sequences, thereby generalizing and improving upon all previous results .
Permanent URL for this record: https://lbezone.hkust.edu.hk/bib/b447458