A note on distinct integer triplets summing to a perfect square in pairs
By Soubhik Chakraborty.
Let i, j and k be three distinct positive integers (we call it a triplet)such that the sum of every pair in the triplet is a perfect square. For example, (2, 34, 47) is a permissible triplet. Permuting the elements of a triplet among themselves, we get six triplets for each combination. The note raises the non trivial problem of finding a functional relationship between c and n where c is the number of such combination triplets such that i, j, k <=n where n is a positive integer.
combination triplets; perfect square
Soubhik Chakraborty, firstname.lastname@example.org
Richard G. Graf, email@example.com
READING THE ARTICLE: You can read the article in
portable document (.pdf) format (81178 bytes.)
NOTE: The content of this article is the intellectual property of the authors, who retains all rights to future publication.
This page has been accessed 2258 times since February 12, 2007.
Return to the Home Page.