Dividing sextuplets
Public  11/20/14  10xp  Programming  41.2% 
There is an obvious generalization of p183 from Philippe. Find all 1 < a < b < c < d < e < f (integer) sextuplets for that
(a1)*(b1)*(c1)*(d1)*(e1)*(f1) divides a*b*c*d*e*f1. You can easily check that this is a valid sextuplet:
[3, 5, 17, 257, 65555, 226112997].
Answer format: cnt,s
where cnt is the number of solutions and s is the sum of a+b+c+d+e+f values over all solutions.
My timing: <1 sec.
(a1)*(b1)*(c1)*(d1)*(e1)*(f1) divides a*b*c*d*e*f1. You can easily check that this is a valid sextuplet:
[3, 5, 17, 257, 65555, 226112997].
Answer format: cnt,s
where cnt is the number of solutions and s is the sum of a+b+c+d+e+f values over all solutions.
My timing: <1 sec.
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