PPT PPH
C_K_Yang czp001 liuguangxi Min_25 C3PO Philippe_57721 gerrob mathpseudo sinan hervas Caesum Buri nielkh
Public  3y  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
 Pamblumsshata 1d:18h
 pipe_palacio 2d:5h
 Sedictious 3d
 zombieadd 3d:16h
 hoppala 1w:2d
Fresh Problems

Generating Seeds 4d:14h
solved by 4 
Sum of three cubes 6d:13h
solved by 6 
Squarefree Numbers 1w:6d
solved by 12 
Carmichael chains 3w
solved by 8 
Standard Nim 3w:5d
solved by 7