131Mathematics · Sequences and Series

Geometric Term and Sum Thresholds

Geometric Term and Sum Thresholds

Find the integer index range for a geometric term or sum threshold, distinguishing finite attainment from a limiting value.

  • 496 bytes
  • COMP mode
01

Worked examples

Example 1

Original exercise. For the geometric sequence, find all positive integer indices satisfying the specified term or partial-sum inequality, and justify the finite boundary or impossibility. a₁=2; r=2; Sₙ>30; n∈ℤ, n≥1.

Answer
n∈ℤ; n≥5.
Standard solution (without a calculator)
  1. Substitute the conditions, solve the equations, then retain only values satisfying the stated domain.
  2. Equation: Sₙ=2(2ⁿ−1).
  3. Calculation: S₄=30; S₅=62; Sₙ₊₁>Sₙ.
  4. Conclusion: n≥5.
Do it on the calculator

Example 2

Original exercise. For the geometric sequence, find all positive integer indices satisfying the specified term or partial-sum inequality, and justify the finite boundary or impossibility. a₁=8; r=1/2; Sₙ≥16; n∈ℤ, n≥1.

Answer
{n∈ℤ:n≥1,Sₙ≥16}=∅.
Standard solution (without a calculator)
  1. Substitute the conditions, solve the equations, then retain only values satisfying the stated domain.
  2. Equation: Sₙ=8(1−2^(−n))/(1−1/2)=16(1−2^(−n)).
  3. Calculation: 2^(−n)>0 ⇒ Sₙ<16.
  4. Conclusion: ∅.
Do it on the calculator

Example 3

Original exercise. For the geometric sequence, find all positive integer indices satisfying the specified term or partial-sum inequality, and justify the finite boundary or impossibility. a₁=64; r=1/2; aₙ≤4; n∈ℤ, n≥1.

Answer
n∈ℤ; n≥5.
Standard solution (without a calculator)
  1. Substitute the conditions, solve the equations, then retain only values satisfying the stated domain.
  2. Equation: aₙ=64×2^(1−n).
  3. Calculation: a₄=8>4; a₅=4; aₙ₊₁=aₙ/2.
  4. Conclusion: n≥5.
Do it on the calculator
02

When to use it

Find the integer index range for a geometric term or sum threshold, distinguishing finite attainment from a limiting value.

Input order

  • A:a → B:r → C:T → D:≥,>,≤,<
  • Enter all fields again for every run. Blank EXE retains old memory; zero must be typed as 0EXE.

Results

  • n_min → n_max
  • All displayed values follow the output order below. A pause requires EXE; the final screen uses AC.

Conditions and limits

  • Require a>0,r≥0. Enter a,r,T,D. Sum modes: 1:≥, 2:>, −1:≤, −2:<; term modes: 11:≥, 12:>, −11:≤, −12:<. Output minimum and maximum n; maximum 0 means unbounded; 0,0 means no solution. −998,−998 means invalid input; −999,−999 means unresolved (transition beyond 200 or too near a limit), never no solution. A convergent sum need not attain its limit. All seven variables and Ans are overwritten.
  • The finite precision and numeric range of the calculator limit very large, very small or nearly cancelling values.

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.