On the size of Diophantine m-tuples

Details On the size of Diophantine m-tuples On the size of Diophantine m-tuples

2000-02-11

arxiv.org/abs/math/0002088v1

Math. Proc. Cambridge Philos. Soc. 132 (2002), 23-33.

Mathematics

Number Theory

16 pages. See also http://www.math.hr/~duje/papers.html

Scientific paper

Let n be a nonzero integer and assume that a set S of positive integers has the property that xy+n is a perfect square whenever x and y are distinct elements of S. In this paper we find some upper bounds for the size of the set S. We prove that if |n| <= 400 then |S| <= 32, and if |n| > 400 then |S| < 267.81 log|n| (log log|n|)^2. The question whether there exists an absolute bound (independent on n) for |S| still remains open.

Affiliated with

Also associated with

No associations

Rating

On the size of Diophantine m-tuples does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the size of Diophantine m-tuples, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the size of Diophantine m-tuples will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-482343