On prime factors of integers of the form (ab+1)(bc+1)(ca+1) (Q3130236)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1002692
Language Label Description Also known as
default for all languages
No label defined
    English
    On prime factors of integers of the form (ab+1)(bc+1)(ca+1)
    scientific article; zbMATH DE number 1002692

      Statements

      On prime factors of integers of the form (ab+1)(bc+1)(ca+1) (English)
      0 references
      0 references
      0 references
      23 April 1997
      0 references
      greatest prime factor
      0 references
      In this paper the following conjecture of \textit{K. Györy}, \textit{A. Sárközy} and \textit{C. L. Stewart} [Acta Arith. 74, 365-385 (1996; Zbl 0857.11047)] is studied: Let \(P(n)\) denote the greatest prime factor of \(n\) and let \(a,b,c\) be distinct positive integers. Then \[ P\bigl((ab+1) (ac+1) (bc+1) \bigr)\to\infty \quad \text{as} \quad \max\{a,b,c\}\to \infty. \tag{1} \] In the present paper the authors prove that (1) holds, provided at least one of \(P(a)\), \(P(b)\), \(P(c)\), \(P(a/b)\), \(P (b/c)\), \(P(c/a)\) is bounded. They also conjecture: Let \({\mathcal A}\) be a finite set of triples \((a,b,c)\) of distinct positive integers. Then there exists \((a,b,c)\in{\mathcal A}\) for which \[ P \bigl((ab+1) (ac +1) (bc+1)\bigr) >c_2\log |{\mathcal A} |\log \log|{\mathcal A}|, \] provided that \(|{\mathcal A} |>2\), where \(c_2\) is an effectively computable positive absolute constant.
      0 references

      Identifiers