Fraction decomposition
Public  08/05/16  8xp  Programming  25.9% 
There is a smallest $ n $ for which there exists a set of distinct integers $ S = \{ s_1, s_2, \dots, s_n \} $ such as
$ \frac{17}{670} = (1\frac{1}{s_1})\times(1\frac{1}{s_2})\times\dots\times(1\frac{1}{s_n}) $
Actually, for this least n the set S is unique.
You are given that S is composed of the union of no more than 4 subsets of consecutive integers.
Find S
Answer format: 'the smallest element''the largest element' comma separated for each subset.
For instance, if $ S = \{2, 3, 4, 5, 11, 12, 13\} = \{2, 3, 4, 5\} \cup \{11, 12, 13\} $, the answer would be: 25,1113
[My timing: 2 sec ]
$ \frac{17}{670} = (1\frac{1}{s_1})\times(1\frac{1}{s_2})\times\dots\times(1\frac{1}{s_n}) $
Actually, for this least n the set S is unique.
You are given that S is composed of the union of no more than 4 subsets of consecutive integers.
Find S
Answer format: 'the smallest element''the largest element' comma separated for each subset.
For instance, if $ S = \{2, 3, 4, 5, 11, 12, 13\} = \{2, 3, 4, 5\} \cup \{11, 12, 13\} $, the answer would be: 25,1113
[My timing: 2 sec ]
New Members
 nebula001 2d:6h
 PeterisP 1w
 Arun_CoDeR 1w
 hankim 2w:2d
 chfmoe 2w:6d
Fresh Problems

Kimberling Sequence 12h
solved by 3 
Palindromic Infinite Sequence 1w
solved by 3 
Convergents of infinite sum 1w:4d
solved by 5 
Permutation Order II 2w
solved by 8 
Integral circle packings 2 2w:4d
solved by 3