An algorithm that can be used as a fast method for spotting simple equations satisfied by collections of seemingly unrelated numbers.

To find out more information pertaining to the Integer Relation Detection Algorithm., please visit the following links:

http://www.nersc.gov/~dhbailey/dhbpapers/pslq-cse.pdf

http://www.cecm.sfu.ca/organics/papers/bailey/

http://www.math.niu.edu/~rusin/known-math/99/lll

http://www.dice.ucl.ac.be/~fkoeune/LLL.html

http://www.math.uu.nl/people/vdkallen/lllimplementations.html

http://www.nersc.gov/~dhbailey/mpdist/mpdist.html

To my understanding. I cannot find a source that actually shows how the IRDA works and all of its technical splender, but what I can find is two different versions of it. That of which being the PSLQ algorithm and the LLL algorithm. Those links above should be able to give anyone who wants to know more about the algorithm, enough information to keep pursing it and using it.