Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Pythagorean triple count

I'm trying to calculate how many Pythagorean triples there are with all arguments under a given value and my program won't finish when I set my limit at 1000.

Here it calculates a number in about a second when I set the limit at 100:

sage: len([(a,b,c) for a in range(1,100) for b in range(1,100) for c in range(1,100) if a^2+b^2==c^2])

But when I switch 100 to 1000 it computes endlessly and I need to abort the program.

Is there a way to make this code more efficient so it doesn't get overloaded? For example I've been trying to find a way to condense the variable range declarations but I'm not getting answers. I'm also new to Sagemath.