Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

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

by sk (Curate)
on Aug 12, 2005 at 05:20 UTC ( #483185=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    X! Y! Z!
    -------
    ...
    since a > b we see that r = a is not the smallest list so r = b<p>
    
    Similarly we can also show that (X-a) + (Z-c) + (b-Y) <= (X-a) + (Y-c)
    + + (b-Z) 
    

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (8)
As of 2019-10-17 02:39 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Notices?