Concept guide
Sequence limits: the exact tail cutoff and an ε-N proof for the reciprocal model
For u(n)=2−3/(n+1) with n∈ℕ0 (the MKO model with L=2, c=−3, d=1): (1) prove that a candidate cutoff N is valid for ε exactly when 3/(N+1)<ε; (2) find the least valid N for ε=1/2 and explain why N=5 fails; (3) prove u(n)→2 from the ε-N definition; (4) show that N must be chosen after ε.