Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

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

by sk (Curate)
on Aug 11, 2005 at 08:50 UTC ( #482867=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    { multiply and divide remaining terms }
    
    ...
    {result}
      35
    
  2. or download this
    n!/k! = PI(x) where x goes from (k+1) to (n) assuming n > k; PI(x) sta
    +nds for product of<p>
    <readmore>
    
  3. or download this
    #!/usr/bin/perl
    
    ...
    print ("Length of expanded numerator   = ", scalar @nexp, $/);
    print ("Length of expanded denominator = ", scalar @dexp, $/);
    print ("Total Number of elements = ", scalar @nexp + scalar @dexp, $/)
    +;
    
  4. or download this
    __END__
    Denominator: Going to push from 44290 to 56089
    ...
    Length of expanded denominator = 44289
    Total Number of elements = 47448
    

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (5)
As of 2019-11-19 05:02 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Strict and warnings: which comes first?



    Results (94 votes). Check out past polls.

    Notices?