Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Complete solution of the polynomial version of a problem of Diophantus (CROSBI ID 105526)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Dujella, Andrej ; Fuchs, Clemens Complete solution of the polynomial version of a problem of Diophantus // Journal of number theory, 106 (2004), 2; 326-344-x

Podaci o odgovornosti

Dujella, Andrej ; Fuchs, Clemens

engleski

Complete solution of the polynomial version of a problem of Diophantus

In this paper, we prove that if {;a, b, c, d}; is a set of four non-zero polynomials with integer coeficients, not all constant, such that the product of any two of its distinct elements plus 1 is a square of a polynomial with integer coeficients, then (a + b − c − d)^2 = 4(ab + 1)(cd + 1). This settles the strong Diophantine quintuple conjecture for polynomials with integer coeficients.

Diophantine m-tuples; simulatenous Pellian equation; linear recurring sequences

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

106 (2)

2004.

326-344-x

objavljeno

0022-314X

Povezanost rada

Matematika

Indeksiranost