Arithmetic Sum: All Integer Indices
Arithmetic Sum: All Integer Indices
Find all positive integer term counts satisfying an arithmetic partial-sum inequality, including two separated solution intervals.
- 590 bytes
- COMP mode
Worked examples
Example 1
Original exercise. For the arithmetic sequence with first term a and difference d, find every positive integer n satisfying the stated condition on Sₙ. a=3; d=2; Sₙ>35; n∈ℤ, n≥1.
Answer
Standard solution (without a calculator)
- Substitute the conditions, solve the equations, then retain only values satisfying the stated domain.
- Equation: Sₙ=n[6+2(n−1)]/2=n(n+2).
- Calculation: n²+2n−35=(n+7)(n−5)>0 ⇒ n>5.
- Conclusion: S₅=35; S₆=48 ⇒ n≥6.
Example 2
Original exercise. For the arithmetic sequence with first term a and difference d, find every positive integer n satisfying the stated condition on Sₙ. a=10; d=-2; Sₙ>0; n∈ℤ, n≥1.
Answer
Standard solution (without a calculator)
- Substitute the conditions, solve the equations, then retain only values satisfying the stated domain.
- Equation: Sₙ=n[20−2(n−1)]/2=n(11−n).
- Calculation: n(11−n)>0; n≥1 ⇒ n<11.
- Conclusion: S₁₀=10; S₁₁=0 ⇒ 1≤n≤10.
Example 3
Original exercise. For the arithmetic sequence with first term a and difference d, find every positive integer n satisfying the stated condition on Sₙ. a=-3; d=2; Sₙ>-4; n∈ℤ, n≥1.
Answer
Standard solution (without a calculator)
- Substitute the conditions, solve the equations, then retain only values satisfying the stated domain.
- Equation: Sₙ=n[−6+2(n−1)]/2=n(n−4).
- Calculation: Sₙ+4=(n−2)²>0 ⇒ n≠2.
- Conclusion: S₁=−3; S₂=−4; S₃=−3 ⇒ n=1 ∪ n≥3.
When to use it
Find all positive integer term counts satisfying an arithmetic partial-sum inequality, including two separated solution intervals.
Input order
- A:a → B:d → D:T → C:>,≥,<,≤
- Enter all fields again for every run. Blank EXE retains old memory; zero must be typed as 0EXE.
Results
- L₁ → U₁ → L₂ → U₂
- All displayed values follow the output order below. A pause requires EXE; the final screen uses AC.
Conditions and limits
- Input a,d,T,mode; modes 1:>, 2:≥, −1:<, −2:≤. Output L₁,U₁,L₂,U₂ for up to two inclusive integer intervals. An upper endpoint −1 means unbounded; 0,0 means absent; four zeros mean no solution. Intersect with any extra upper bound yourself. Check adjacent integer sums at strict boundaries. Large cancelling totals around 10¹²–10¹³ can shift an endpoint by one. All seven variables and Ans are overwritten; display returns to Norm 1.
- The finite precision and numeric range of the calculator limit very large, very small or nearly cancelling values.
Checking access…