Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

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

by QM (Parson)
on Aug 11, 2005 at 23:33 UTC ( #483148=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    10389! 4570! 44289! 11800!
    ------------------------------
    56089! 989! 9400! 43300! 2400!
    
  2. or download this
    8.070604647867604097576877675243109941805e-7030
    8.070604647867604097576877675243109941729476950993498765160880e-7030
    
  3. or download this
    #!/your/perl/here
    
    ...
    {
        print +shift, ": ", timestr(timediff(@_)), "\n";
    }
    
  4. or download this
    foreach my $t ( keys %{$factors} )
    {
        my $bft = $ONE->copy()->bmul($t)->bpow($factors->{$t});
        $q->bmul($bft);
    }
    
  5. or download this
    my $s = '$q';
    foreach my $t ( keys %{$factors} )
    ...
    }
    eval $s;
    die "Error on eval: $@" if $@;
    

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (6)
As of 2019-10-14 18:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?