Basics Archives Community Services Programming
Hardware Help About Search Your Account
   Home :: Archives :: File Archives :: Inequality Solver 1
Inequality Solver 1


Ranked as 26956 on our all-time top downloads list with 1670 downloads.
Ranked as 1818 on our top downloads list for the past seven days with 4 downloads.

Filename solver1.zip (Download)
Title Inequality Solver 1
Description This program is a multi purpose inequality solver. You can use all of the = ≠ > < ≥ ≤ -signs. The program uses the solve(- function and can find up to six inequalities, or six roots. If there are less of them, the program stops with an ERROR: NO SIGN CHANGE. Just press for QUIT then. For the program to work, the graph needs to cross the X- axis at least once. So if you don't get an answer, press [ GRAPH ]. If the graph is entirely above, or below, the X- axis, the answer should be for all X's defined, or for no X's, if it's an inequality. Otherwise you have no solution. Some statements it can handle: A*abs(BX+C)+D≥E, abs(X^2+2X-3)≤X+1, abs((X-3)(X+2))=4, (X^3-7)^(1/3)>X-1, √(7X-4)<7X-4, √(4X+3)+√(4X-3)>4. If the statement gives a continuous function the program can solve it if the function is differentiable in the proximity of its real roots.
Authors Anders Tiberg (anders.tiberg@telia.com)
Joe Erdeky (erdeky@inbox.com)
Category TI-84 Plus C Silver Edition/CE BASIC Math Programs
File Size 1,933 bytes
File Date and Time Sun Nov 3 17:04:30 2013
Documentation Included? Yes



There are no reviews for this file.


Questions, comments, and problems regarding the file itself should be sent directly to the author(s) listed above.

Write a review for this file (requires a free account)

Report inappropriate or miscategorized file (requires an account; or you may email us directly)

If you have downloaded and tried this program, please rate it on the scale below
1  2  3  4  5  6  7  8  9  10  


Archive Contents
Name Size
ASOLVER1 TI-84 Plus C Silver Edition.8xp   905
ASOLVER1.rtf   2252

  Copyright © 1996-2012, the ticalc.org project. All rights reserved. | Contact Us | Disclaimer