文章基本信息

标题：Some polynomial formula of the Diophantine Quadruple with D(n) property
本地全文：下载
作者：Abdul Hakeem Phulpoto ; Israr Ahmed ; Inayatullah Soomro 等
期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2019
卷号：19
期号：4
页码：249-251
出版社：International Journal of Computer Science and Network Security
摘要：The original problem of quadruple was studied by the Since the Greek mathematician Diophantus of Alexandria 1/16 , 33/16 ,17/4 and 105/16 was the first set of quadruples found in 3^rd century (b.c) in which having any product of two terms increasing the set increased by 1 is a perfect square. Later Fermat obtained a set from integers as {1,3,8,120}, later davenport and baker both to generalize the fourth member of the set is, {1,3,8, d}. Here in this work we will present a more generalized version of Diophantine quadruple, {p, q, r, s}, where any two of the product increased by n result will be a perfect square, i.e. pq+n=x^2 and, It is proved that the Diophantine quadruple , set of positive and negative integer number with the property that the product of any two of them plus n is a perfect square, than generalization of the result is obtained.
关键词：diophantine quadruple ;arithmeticprogression; diophantine m-tuple