3:27:15pjbebrasca: I don't like lisp-critic too much. I find some advises ill-advisen, some outdated, very few useful. Read it, and use your own ruleset!
3:29:57rdapSo I only need to generate a list of primes up to the square root of the number that was input
3:31:38rdapso, generate a list of integers up to the square root..
3:32:53rdapthen copy to a new list every 2nd from the 2nd, every third from the third, every 5th from the 5th, and so on
3:34:08rdapthen divide the input number by everythin in the list and eliminate everything that doesn't divide by x into an integer
3:35:28rdapthen the list should contain nothing but prime factors
3:39:37pjbrdap: yes. But you can avoid generating list of numbers. Using a bit-vector takes less space.
3:39:52pjbAnd you can make a bit-vector of only the odd numbers, halving the needed bits.
3:40:19rdapah yes, because anything even is a composite of 2
3:41:05pjbor you can just use com.informatimago.common-lisp.arithmetic.primes:compute-primes-to
3:42:11rdapi'm not sure i have that, and i feel like that would be cheating
3:42:37pjbthen compare when you're done with yours.
4:26:50gilberthAnd they don't even compile the regular expression. As in: compiling it to native code eventually. And flex^Wbison cannot do submatch addressing.