Tarlok Nath Shorey - The greatest square free factor of a binary recursive sequence

hrj:97 - Hardy-Ramanujan Journal, January 1, 1983, Volume 6 - 1983 - https://doi.org/10.46298/hrj.1983.97
The greatest square free factor of a binary recursive sequenceArticle

Authors: Tarlok Nath Shorey 1

If Δm,n denotes the quotient [um,vn]/(um,vn) of the lcm by the gcd, we obtain in this paper a lower bound for the greatest square-free factor Q[Δm,n] of Δm,n when uh=vh,m>n (and un0); this implies a lower bound for logQ[un] of the form C(logm)2(loglogm)1, thereby improving on an earlier result of C. L. Stewart.


Volume: Volume 6 - 1983
Published on: January 1, 1983
Imported on: March 3, 2015
Keywords: greatest prime factor,binary recursive sequence,greatest square-free factor,[MATH]Mathematics [math]

Consultation statistics

This page has been seen 237 times.
This article's PDF has been downloaded 292 times.