Re: Finding the Number of Pythagorean Triples below a bound
- To: mathgroup at smc.vnet.net
- Subject: [mg68242] Re: Finding the Number of Pythagorean Triples below a bound
- From: titus_piezas at yahoo.com
- Date: Sun, 30 Jul 2006 04:48:29 -0400 (EDT)
- References: <eaeqa3$53v$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Hello all,
To be specific, I am looking for some code applicable to the more
general bivariate polynomial,
Poly(a,b) = c^2
where {a,b} are positive integers, 0 < a <=b, and of which the
Pythagorean triples are just a special case. The problem is to find
S(10^m) which is the number of solutions with c < 10^m for as "high" as
m=5,6 with a reasonable run-time of, say, an hour or less.
Anybody knows of such code?
-Titus
- Follow-Ups:
- Re: Re: Finding the Number of Pythagorean Triples below a bound
- From: Andrzej Kozlowski <akoz@mimuw.edu.pl>
- Re: Re: Finding the Number of Pythagorean Triples below a bound