Bounds for the size of sets with the property D(n)

From MaRDI portal
Publication:4662136




Abstract: Let n be a nonzero integer and a_1 < a_2 < ... <a_m positive integers such that a_i*a_j + n is a perfect square for all 1 <= i < j <= m. It is known that m <= 5 for n = 1. In this paper we prove that m <= 31 for |n| <= 400 and m < 15.476 log|n| for |n| > 400.









This page was built for publication: Bounds for the size of sets with the property D(n)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4662136)