Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

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

by sk (Curate)
on Aug 12, 2005 at 05:20 UTC ( [id://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
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://483185]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others scrutinizing the Monastery: (7)
As of 2024-04-16 08:17 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found