Description
Update: Fixed a bug in ADDMULT1. ADDMULT uses CFRAC, and ADDMULT1 uses Euclid’s algorithm to find the divisors. These programs are built on the fact that second degree equations with rational roots can be solved by dividing the coefficients in Ax^2+Bx+C=0, with A, and then select a pair of divisors in C/A that multiply to C/A and add up to B/A, then it follows that those divisors are the (rational) roots of the equation. The condition for that is of course that the root of the Discriminant is rational, as well as the coefficients. The programs are therefore showing the Discriminant and its root, as well as B/A and C/A for your convenience.
Archive Contents
| Name | Size |
|---|---|
| ADDMULT/ADDMULT.rtf | 1.2 KB |
| ADDMULT/ADDMULT1.g3m | 352 bytes |
| ADDMULT/ADDMULT.g3m | 376 bytes |
- File Size
- 3.0 KB
- Short link
- http://ceme.tech/DL2448
Metadata
- Author
- Anders
- Uploaded
- 1 month, 2 weeks ago
Statistics
- Rating
- No ratings.
- Downloads
- 152
- ↳ this version
- 25
- Views
- 1125
- ↳ this version
- 308
Reviews
Nobody has reviewed this file yet.Versions
- Adds to Multiplies To (published 1 month, 2 weeks ago; 2024-03-09 13:03 UTC)
- Adds To Multiplies To (published 1 month, 3 weeks ago; 2024-03-06 13:23 UTC)
- ADDS TO MULTIPLIES TO (published 2 months ago; 2024-02-28 18:48 UTC)
- ADDS TO MULTIPLIES TO (published 2 months ago; 2024-02-26 21:13 UTC)
- ADDS TO MULTIPLIES TO (published 2 months ago; 2024-02-25 16:31 UTC)
- ADDS TO MULTIPLIES TO (published 2 months ago; 2024-02-23 13:39 UTC)
- ADDS TO MULTIPLIES TO (published 2 months ago; 2024-02-22 23:31 UTC)
Advertisement