PPT PPH
C_K_Yang czp001 liuguangxi Min_25 C3PO Philippe_57721 gerrob mathpseudo sinan hervas Caesum Buri nielkh
Public  07/04/14  8xp  Programming  58.3% 
Consider the primitive Phytagorean triangles with an hypotenuse equal to a Pythagorean prime (i.e. a prime of the form 4*n+1).
How many such triangles are there if their hypotenuses are between 10^19 and 10^19+10^6?
Input format: count,sum of the smallest sides
Example: 11,248 for such triangles with hypotenuses in the range [1,100]
[My timing: <8s]
How many such triangles are there if their hypotenuses are between 10^19 and 10^19+10^6?
Input format: count,sum of the smallest sides
Example: 11,248 for such triangles with hypotenuses in the range [1,100]
[My timing: <8s]
New Members
 choiyd 4d:12h
 phacks 5d:7h
 MemorySlices 5d:12h
 n3chto 1w
 2997ms 1w:1d
Fresh Problems

Special Squares 4d:19h
solved by 8 
Sum of phi 1w:1d
solved by 4 
Decomposable Triangles 1w:4d
solved by 6 
A cubic form 1w:6d
solved by 4 
Automatic typewriter 2w:1d
solved by 5