Abstract
In this paper we prove the best possible upper bounds for the number of elements in a set of polynomials with integer coefficients all having the same degree, such that the product of any two of them plus a linear polynomial is a square of a polynomial with integer coefficients. Moreover, we prove that there does not exist a set of more than 12 polynomials with integer coefficients and with the property from above. This significantly improves a recent result of the first two authors with Tichy [A. Dujella, C. Fuchs, R.F. Tichy, Diophantine m-tuples for linear polynomials, Period. Math. Hungar. 45 (2002) 21–33].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
