188Mathematics · More about equations

Quadratic Inequality Solution Sets

Quadratic Inequality Solution Sets

Quadratic Inequality Solution Sets. Output order: solution type code D, r₁ / r, r₂

  • 336 bytes
  • COMP mode
01

Worked examples

Example 1

Solve the inequality over the real numbers. State the complete solution set and justify inclusion of each endpoint. −2x²−3x+9<0 Find the requested quantities and show a mathematical derivation.

Answer
x∈(−∞,−3)∪(3/2,∞); D=2
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data.
  2. −2x²−3x+9=−(2x−3)(x+3)
  3. −(2x−3)(x+3)<0 ⇔ (2x−3)(x+3)>0
  4. r₁=−3; r₂=3/2
  5. x<−3 ∨ x>3/2
Do it on the calculator

Example 2

Solve the inequality over the real numbers. State the complete solution set and justify inclusion of each endpoint. −4x+14≤0 Find the requested quantities and show a mathematical derivation.

Answer
x∈[7/2,∞); D=9
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data.
  2. a=0: −4x+14≤0
  3. −4x≤−14
  4. x≥(−14)/(−4)=7/2
Do it on the calculator

Example 3

Solve the inequality over the real numbers. State the complete solution set and justify inclusion of each endpoint. x²+8x+16>0 Find the requested quantities and show a mathematical derivation.

Answer
x∈ℝ∖{−4}; D=11
Standard solution (without a calculator)
  1. Build the mathematical model and substitute the data.
  2. x²+8x+16=(x+4)²
  3. (x+4)²≥0; (x+4)²=0 ⇔ x=−4
  4. (x+4)²>0 ⇔ x≠−4
Do it on the calculator
02

When to use it

Solve the inequality over the real numbers. State the complete solution set and justify inclusion of each endpoint.

Input order

  • A=a; B=b; C=c; f(x)=ax²+bx+c
  • M=1:≥0; M=2:>0; M=3:≤0; M=4:<0
  • Enter every required value explicitly, including 0. Blank EXE keeps the stored value; it is not an entry of zero.
  • For decimal coefficients with Δ near zero or greatly different scales, finite precision may change the solution type. Check by factorisation or completing the square.

Output order

  • solution type code D
  • r₁ / r
  • r₂

Conditions and limitations

  • a,b,c∈ℝ
  • A=a; B=b; C=c; M∈{1,2,3,4}; A,B,C,M: EXE≠0
  • 0:∅; 1:ℝ; 2:x<r₁ ∨ x>r₂; 3:x≤r₁ ∨ x≥r₂
  • 4:r₁<x<r₂; 5:r₁≤x≤r₂; 6:x<r; 7:x≤r; 8:x>r; 9:x≥r; 10:x=r; 11:x≠r
  • D∈{0,1}⇒[D]; 2≤D≤5⇒[D,r₁,r₂]; 6≤D≤11⇒[D,r]
  • For integer coefficients, magnitudes at most 100000 are recommended; noninteger coefficients are also supported.
  • Enter every required value explicitly, including 0. Blank EXE keeps the stored value; it is not an entry of zero.
  • For decimal coefficients with Δ near zero or greatly different scales, finite precision may change the solution type. Check by factorisation or completing the square.
  • −1 marks an invalid comparison code; it is not the empty set. Extreme invalid codes may cause Math ERROR.
  • Each new run may overwrite the working registers and Ans. Enter the known values again.

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.

Checking access…

Sign in to unlock the full programme

Checking access…

The programme code and appendix unlock together.