Count in factors: Difference between revisions
Content added Content deleted
(→{{header|Haskell}}: add 2144..) |
(→{{header|Haskell}}: comment about real solution being a segmented offset sieve) |
||
| Line 561: | Line 561: | ||
"2 * 3 * 359" |
"2 * 3 * 359" |
||
. . .</lang> |
. . .</lang> |
||
The real solution seems to have to be some sort of a segmented offset sieve of Eratosthenes, storing factors in array's cells instead of just marks. That way the speed of production might not be diminishing as much. |
|||
=={{header|Icon}} and {{header|Unicon}}== |
=={{header|Icon}} and {{header|Unicon}}== |
||