Sequence Sum Threshold
Sequence Sum Threshold
Find the smallest or largest positive integer n for which the partial sum is strictly greater than K. Check the adjacent sum.
- 416 bytes
- COMP mode
Worked examples
Example 1
Original practice. Find the smallest or largest positive integer n for which the partial sum is strictly greater than K. Check the adjacent sum. M=1; a=11; d=5; Sₙ>450; n∈ℤ,n≥1. min n=?
Answer
Standard solution (without a calculator)
- Sₙ=n(5n+17)/2; Sₙ₊₁−Sₙ=11+5n>0
- S₁₁=396≤450; S₁₂=462>450; min n=12
- Expand or substitute to verify each equality above.
Example 2
Original practice. Find the smallest or largest positive integer n for which the partial sum is strictly greater than K. Check the adjacent sum. M=1; a=20; d=−3; Sₙ>0; n∈ℤ,n≥1. max n=?
Answer
Standard solution (without a calculator)
- Sₙ=n(43−3n)/2>0 ⇔ 0<n<43/3
- max n=14; S₁₄=7>0; S₁₅=−15≤0
- Expand or substitute to verify each equality above.
Example 3
Original practice. Find the smallest or largest positive integer n for which the partial sum is strictly greater than K. Check the adjacent sum. M=2; a=3; r=2; Sₙ>300; n∈ℤ,n≥1. min n=?
Answer
Standard solution (without a calculator)
- Sₙ=3(2ⁿ−1); Sₙ₊₁−Sₙ=3×2ⁿ>0
- S₆=189≤300; S₇=381>300; min n=7
- Expand or substitute to verify each equality above.
When to use it
Find the smallest or largest positive integer n for which the partial sum is strictly greater than K. Check the adjacent sum.
Input order
- M,a,d/r,K,X
- M=1/2→j; A=a→u; B=d/r; C=K; D=n; X=1/2→M²+X; Y=S
- M∈{1,2}; M=1:a,d∈ℝ; M=2:a>0,r>0; X=1:min n; X=2:max n; n∈ℤ,1≤n≤1000000; Sₙ>K; S₀=0
- Fill every field explicitly, including 0. Blank EXE uses the current memory value; clearing memory makes it 0, but cannot detect omissions. All variables and Ans are overwritten.
Output order
- n,Sₙ,Sₙ₋₁ (X=1); n,Sₙ,Sₙ₊₁ (X=2); −1,−2,−3,−4
- At most 1000 local search steps and n≤1000000. Constant arithmetic terms and geometric sums are accumulated without a closed-form jump. Exceeding the search budget does not prove that no answer exists.
- −1: no valid positive integer; −2: no finite maximum; −3: invalid input; −4: search/index budget exhausted.
Conditions and limits
- Use COMP and Norm 1; the images use Deg, which does not change this algebra.
- All intermediate values must remain within calculator range. Decimal outputs are approximations. Check nearly equal values with exact algebra; an error or overflow invalidates the whole run.
- At most 1000 local search steps and n≤1000000. Constant arithmetic terms and geometric sums are accumulated without a closed-form jump. Exceeding the search budget does not prove that no answer exists.
- −1: no valid positive integer; −2: no finite maximum; −3: invalid input; −4: search/index budget exhausted.
- After the final screen press AC. An extra EXE starts a new run; it does not reveal another result.
Checking access…