Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

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

by ikegami (Pope)
on Aug 08, 2005 at 19:55 UTC ( #481999=note: print w/replies, xml ) Need Help??


in reply to Re^2: Algorithm for cancelling common factors between two lists of multiplicands
in thread Algorithm for cancelling common factors between two lists of multiplicands

oops, you're right. I can't figure out what the pattern is. What does he mean by "canceling out"?

Update: Here's a solution:

use Math::BigInt (); use Math::Big::Factors (); my $a = Math::BigInt->new(1); $a *= $_ foreach @a; # 17820000 my $b = Math::BigInt->new(1); $b *= $_ foreach @b; # 19872000 my $gcd = Math::BigInt::bgcd($a, $b); # 108000 my $c = $a / $gcd; # 165 my $d = $b / $gcd; # 184 my @c = Math::Big::Factors::factors_wheel($c); # 3, 5, 11 my @d = Math::Big::Factors::factors_wheel($d); # 2, 2, 2, 23

Not quite the solution you asked for. Close enough?

  • Comment on Re^3: Algorithm for cancelling common factors between two lists of multiplicands
  • Download Code

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://481999]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (2)
As of 2019-10-21 05:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?