Read More  www.beeman.us  Important Notice 
Remember, what you get out of this is only as good as what you put in. Just looking at problems and answers is a waste of time. So get out your pencil and paper (and an eraser) and let's factor some quadratics!!
2X^{2} + 7X + 3 = 0

(2X + 1) (X + 3) 
All of these problems will have factors of the form (JX + K) where J and K are integers and have the maximum and minimum limits as you set in the boxes. K can be zero only if its limits include zero AND you check the "Allow K = 0" check box.
For the default values, I have adopted the convention that J, the coefficient of X in the factors, has a minimum value of 1. Therefore A, the coefficient of X^{2}, is always positive. This in no way negates the value of the practice, because if A were negative, you could simply multiply both sides of the equation by 1 and produce an equivalent problem with A positive, and with identical roots.
Thanks to Margaret Fennell for reviewing the accuracy of the page and for pointing out the need to make sure the factors shown are prime. This is done by using Euclid's algorithm to find the GCD of J and K in each factor, dividing J and K by this, and prefixing the (Jx + K) factors with the product of the common factors found for them.
This page has been tested with recent Mac OSX versions of Safari, Internet Explorer, and Netscape, as well as Internet Explorer for Windows. If you find any errors in this page, please . Be sure to include the URL of the page, the Quadratic that had a problem, your Operating System (OSX, Windows, Linux), the name of the browser (Safari, Netscape, Internet Explorer) and the version number of the browser.
The random function used here is the JavaScript "Math.random()" function. This function is good enough for generating random functions for games and tutorials, but should NEVER, EVER be used for cryptographic or math research applications, because it is not sufficiently random.
For those purposes, your computer's OS contains an "Entropy Cache" which is kept up to date, and which should be used as the seed for a cryptographically secure Pseudo Random Number Generator (PRNG).
For more information on the need for randomness in cryptographic functions, and means of achieving this, see RFC1750 published by the Internet Engineering Task Force (IETF).
My only reward for writing this is the 15 milliseconds of fame I receive from having my name here. Don't deprive me of that.
You can copy this page by simply doing a "Save As" in your browser and putting it somewhere on your hard drive (or your web site). If you stop there the background will be gone. To preserve the background, copy the following file into this same folder, without changing its name, by again using your browser's "Save As". The next time you refresh the page, the background should be restored: