A quantitative lower bound for the greatest prime factor of (ab+1)(bc+1)(ca+1)
From MaRDI portal
Publication:4811278
DOI10.4064/aa114-3-3zbMath1122.11060OpenAlexW2021016194MaRDI QIDQ4811278
Publication date: 18 August 2004
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: http://journals.impan.gov.pl/aa/Inf/114-3-3.html
Primes represented by polynomials; other multiplicative structures of polynomial values (11N32) Multiplicative and norm form equations (11D57)
Related Items
Carmichael numbers in the sequence $(2^n k+1)_{n\geq 1}$ ⋮ Quantitative versions of the subspace theorem and applications ⋮ On Arithmetic Properties of Products and Shifted Products ⋮ A note on the number of $S$-Diophantine quadruples ⋮ Sierpiński and Carmichael numbers ⋮ On the greatest common divisor of \(u-1\) and \(v-1\) with \(u\) and \(v\) near \(\mathcal S\)-units
This page was built for publication: A quantitative lower bound for the greatest prime factor of (ab+1)(bc+1)(ca+1)