Use k(j)=index_start+index_step*j on natural j starting at0, with index_start=17≥0 and positive integer index_step=3. Give (index_start, index_step, index_formula, strictly_increasing, certificate).
G001 — Use k(j)=index_start+index_step*j on natural j starting at0, with index_start=17≥0 and positive integer index_step=3. Give (index_start, index_step, index_formula, strictly_increasing, certificate).
Definition and scope
Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.
Retain the historical interface marker in the original snapshot while listing ordered source fields here,without JavaScript or external lookup.Field labels are not additional mathematical evidence,and No retains the source claim scope.
original subsequence index k:ORIGINAL nonnegative start=17;positive integer step=3;F(q)=start+step*q for EVERY natural q>=0
After
F(q)>=start>=0 and for ANY q<r,F(r)-F(q)=(3)*(r-q)>0;strictly increasing on ALL naturals,not just the evaluated prefix
Conditions: none
A positive integer step preserves the order of every pair of natural indices,not merely injectivity or an arbitrary reordering.This universal mathematical law is not truncated by an evaluated-output safety range and says nothing about monotonicity of source values.
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.
This question review and source binding
Review date: 2026-10-26
Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.