On the greatest prime factor of binary recurrence sequences
by Ling Kei Hung
THESIS
1994
M.Phil. Mathematics
vi, 34 leaves ; 30 cm
Abstract
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 .
Post a Comment