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 t
Diophantine m-tuples for quadratic polynomials
✍ Scribed by Jurasić, Ana
- Book ID
- 122474771
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 171 KB
- Volume
- 43
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A set of m positive integers is called a Diophantine m-tuple if the product of its any two distinct elements increased by 1 is a perfect square. We prove that if [a, b, c] is a Diophantine triple such that b>4a and c>max[b 13 , 10 20 ] or c>max[b 5 , 10 1029 ], then there is unique positive integer
We study the Hardy Littlewood method for the Laurent series field F q ((1ÂT )) over the finite field F q with q elements. We show that if \* 1 , \* 2 , \* 3 are non-zero elements in F q ((1ÂT )) satisfying \* 1 Â\* 2 Â F q (T ) and sgn(\* 1 )+sgn(\* 2 )+sgn(\* 3 )=0, then the values of the sum \* 1