factor-group function

[cameyo]

To solve a project euler problem i have written this factor-group function:

Code Select Expand

(define (factor-group x)
  (letn (fattori (factor x)
         unici (unique fattori))
    (transpose (list unici (count unici fattori)))))

(factor-group 2000)
;-> ((2 4) (5 3))
(factor-group 232792560)
;-> ((2 4) (3 2) (5 1) (7 1) (11 1) (13 1) (17 1) (19 1))

Do you known a better/faster way?

Thanks.



cameyo

[rrq]

Nice.



The factorization is of course the "slow" part, whereas the result juggling is almost irrelevant time-wise. I wouldn't try to improve on your implementation, but as a hind-sight, I probably would have used

Code Select Expand

(map list unici (count unici fattori)) instead of

Code Select Expand

(transpose (list unici (count unici fattori))) just because it intuitively would be less structure re-arrangement.

And I also wouldn't have known to use Italian named variables :)

[cameyo]

Thanks Ralph.

I am really enjoying newLisp :-)

cameyo

[cameyo]

I forgot to add the inverse function:

Code Select Expand

(setq fg (factor-group 220))
;-> ((2 2) (5 1) (11 1))

Code Select Expand

(setq num-fg (apply * (map (lambda (x) (pow (first x) (last x))) fg)))
;-> 220

cameyo