EUVIMEDEUVIMED entdecken
Crossref

The greatest square free factor of a binary recursive sequence

Tarlok Nath Shorey

Hardy-Ramanujan Journal · 1983

DOI: 10.46298/hrj.1983.97 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Hardy-Ramanujan Journal, 1983. Verfasst von Tarlok Nath Shorey.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

If $\Delta_{m,n}$ denotes the quotient $[u_m,v_n]/(u_m,v_n)$ of the lcm by the gcd, we obtain in this paper a lower bound for the greatest square-free factor $Q[\Delta_{m,n}]$ of $\Delta_{m,n}$ when $u_h=v_h, m>n$ (and $u_n\neq0$); this implies a lower bound for $\log Q[u_n]$ of the form $C(\log m)^2(\log\log m)^{-1}$, thereby improving on an earlier result of C. L. Stewart.

Zitieren

APA

Shorey, T. N. (1983). The greatest square free factor of a binary recursive sequence. Hardy-Ramanujan Journal. https://doi.org/10.46298/hrj.1983.97

Vancouver

Shorey TN. The greatest square free factor of a binary recursive sequence. Hardy-Ramanujan Journal. 1983. doi:10.46298/hrj.1983.97

BibTeX
@article{Shorey1983,
  author = {Shorey, Tarlok Nath},
  title = {The greatest square free factor of a binary recursive sequence},
  journal = {Hardy-Ramanujan Journal},
  year = {1983},
  doi = {10.46298/hrj.1983.97}
}
Kostenlos starten →