Syntactic Confectionery Delight PerlMonks

### Re^2: Algorithm for cancelling common factors between two lists of multiplicands

by BrowserUk (Patriarch)
 on Aug 08, 2005 at 20:20 UTC Need Help??

Thankyou hv.

That'll work. I don't suppose you know of a good factoring algorithm?

I'd like to avoid Math::Pari (if possible) for this.

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?
"Science is about questioning the status quo. Questioning authority".
The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.
• Comment on Re^2: Algorithm for cancelling common factors between two lists of multiplicands

Replies are listed 'Best First'.
Re^3: Algorithm for cancelling common factors between two lists of multiplicands
by hv (Prior) on Aug 09, 2005 at 00:07 UTC

For simple problems I usually use something like this:

```{
my @p; BEGIN { @p = (2, 3) }
sub nextprime {
my \$p = \$p[\$#p];
DIV: while (1) {
\$p += 2;
my \$pc = 0;
while (1) {
my \$d = \$p[\$pc++];
last if \$d * \$d > \$p;
next DIV unless \$p % \$d;
}
\$p[@p] = \$p;
return \$p;
}
}

sub factors {
my \$n = shift;
my(\$pc, @result) = (0);
while (\$n > 1) {
my \$d = \$p[\$pc++] || nextprime();
if (\$d * \$d > \$n) {
push @result, \$n;
\$n = 1;
} else {
while (\$n % \$d == 0) {
\$n /= \$d;
push @result, \$d;
}
}
}
\@result;
}
}

The rest of the time I use Math::Big*, sometimes with Pari or (lately) GMP.

Hugo

Nice, thankyou. I like nextPrime(). I was kludging something together by embedding the first 1000 primes in a DATA section.

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?
"Science is about questioning the status quo. Questioning authority".
The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.
Re^3: Algorithm for cancelling common factors between two lists of multiplicands
by hv (Prior) on Jun 10, 2022 at 17:19 UTC

Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://482014]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others sharing their wisdom with the Monastery: (6)
As of 2024-04-25 11:12 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?

No recent polls found