{ "schema_version": "ocme-reviewed-question-reader-v1", "question_id": "q-20261013-advance-20261021-r03-orbit-fixed-periodic-0090", "pilot_number": "R0004-02565", "number": 2565, "family_id": "qf-app21-orbit-periodic-inventory", "title": { "zh-Hant": "第 2565 題：有限軌道與週期", "en": "Question 2565: Every Point’s Least Period in the Complete Finite Model" }, "original_question": { "schema_version": "ocme-question-v0.1", "id": "q-20261013-advance-20261021-r03-orbit-fixed-periodic-0090", "batch_id": "batch-20261013-advance-20261021-r03-orbit-fixed-periodic-foundations", "language": "zh-Hant", "source_mko_ids": [ "mko-orbit-fixed-periodic" ], "title_zh": "有限軌道與週期", "stem_zh": "完整有限狀態自映射。操作=orbit-periodic-inventory；資料={\"modulus\":7,\"a\":-3,\"b\":6,\"period_bound\":3}。請依 [modulus,a,b,period_bound,point_period_rows,selected_points] 欄序回答。", "answer": { "kind": "expression", "value": "(7, -3, 6, 3, [[0, 3], [1, 3], [2, 3], [3, 3], [4, 3], [5, 1], [6, 3]], [0, 1, 2, 3, 4, 5, 6])", "explanation_zh": "應用擴展核對=(7, -3, 6, 3, [[0, 3], [1, 3], [2, 3], [3, 3], [4, 3], [5, 1], [6, 3]], [0, 1, 2, 3, 4, 5, 6])；依完整明示資料重算；完整明示的有限／精確切片不是一般定理或人員判定；固定點與最小正週期分開；只分類指定有限模型。" }, "difficulty": { "band": "undergraduate_core", "level": 2, "skills": [ "有限軌道與週期" ] }, "variant": { "family_id": "qf-app21-orbit-periodic-inventory", "seed": 202610213090, "parameters": { "modulus": 7, "a": -3, "b": 6, "period_bound": 3, "domain": "Finite_orbit_periodicity", "operation": "orbit-periodic-inventory", "semantic_template": "qf-app21-orbit-periodic-inventory/{\"a\":-3,\"b\":6,\"modulus\":7,\"period_bound\":3}" } }, "verification": { "status": "candidate", "checks": [ "producer_exact_finite_model", "producer_source_snapshot_check", "producer_substantive_template_deduplication", "producer_json_schema" ], "warning_zh": "僅為產生端候選及自檢；主端須另驗，不構成人工審定、一般定理、真實學生診斷、經驗預測、Lean執行或形式Evidence。" }, "provenance": { "generator_role": "question_producer", "generator_model": "model_unknown", "generated_at": "2026-10-13", "contract_version": "ocme-question-factory-v0.1" } }, "original_english_edition": { "schema_version": "ocme-question-localization-v0.1", "question_id": "q-20261013-advance-20261021-r03-orbit-fixed-periodic-0090", "batch_id": "batch-20261013-advance-20261021-r03-orbit-fixed-periodic-foundations", "locale": "en", "translation_state": "ai_candidate", "source": { "question_sha256": "fe51b68791276032f1fc59a75375d9db2b6bc92eb40b6d337d949c93654cc73e", "family_id": "qf-app21-orbit-periodic-inventory", "seed": 202610213090, "semantic_template": "qf-app21-orbit-periodic-inventory/{\"a\":-3,\"b\":6,\"modulus\":7,\"period_bound\":3}" }, "fields": { "title": "Every Point’s Least Period in the Complete Finite Model", "stem": "Use the complete finite self-map on Fin(7)={0,…,6}, T(x)=(a*x+b) mod 7, a=-3, b=6. Take least nonnegative residues even for negative a*x+b. Fixed points, return times and least positive periods are different notions; the conclusion concerns this finite model only. Positive period bound=3. Give (modulus,a,b,bound,every [point,least period or nonperiodic-point] row in point order,points whose least positive period is at most the bound).", "answer": { "kind": "expression", "value": "(7, -3, 6, 3, [[0, 3], [1, 3], [2, 3], [3, 3], [4, 3], [5, 1], [6, 3]], [0, 1, 2, 3, 4, 5, 6])", "explanation": "Enumerate every state, distinguish transient starting points from cycle points and filter only defined least periods. This explicit finite/exact slice is neither a general theorem nor a judgment about a person. The exact result, retaining the requested order, is (7, -3, 6, 3, [[0, 3], [1, 3], [2, 3], [3, 3], [4, 3], [5, 1], [6, 3]], [0, 1, 2, 3, 4, 5, 6])." }, "skills": [ "Every Point’s Least Period in the Complete Finite Model" ], "verification_warning": "This is a candidate exercise. Mechanical recomputation checks only the stated conditions and this instance; it is neither a formal proof nor human review." } }, "givens": [ { "id": "G001", "text": { "zh-Hant": "完整有限狀態自映射。操作=orbit-periodic-inventory；資料={\"modulus\":7,\"a\":-3,\"b\":6,\"period_bound\":3}。請依 [modulus,a,b,period_bound,point_period_rows,selected_points] 欄序回答。", "en": "Use the complete finite self-map on Fin(7)={0,…,6}, T(x)=(a*x+b) mod 7, a=-3, b=6. Take least nonnegative residues even for negative a*x+b. Fixed points, return times and least positive periods are different notions; the conclusion concerns this finite model only. Positive period bound=3. Give (modulus,a,b,bound,every [point,least period or nonperiodic-point] row in point order,points whose least positive period is at most the bound)." } } ], "steps": [ { "id": "S001", "uses": [ "G001" ], "before": "n=7; a=-3; b=6", "after": "S={0,...,6}; T(z)=(a·z+b) mod n", "relation": "implies", "rule_id": "finite_self_map", "conditions": [], "explanation": { "zh-Hant": "餘數取0到n−1，故每個狀態都有唯一後繼且仍在同一有限集合；負數輸入也不取負餘數。", "en": "Remainders lie in0,...,n−1,so every state has one successor in the same finite set;negative dividends do not produce negative canonical remainders." }, "reverse_audit": { "kind": "premise_and_result_audit", "explanation": { "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。", "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence." } }, "arithmetic": null }, { "id": "S002", "uses": [ "G001", "S001" ], "before": "start=0", "after": "record each state before its first successor calculation", "relation": "implies", "rule_id": "orbit_initial_state", "conditions": [], "explanation": { "zh-Hant": "從指定點本身開始，不把第一次更新值誤記為初始狀態。", "en": "Start with the specified point itself,not its first successor." }, "reverse_audit": { "kind": "premise_and_result_audit", "explanation": { "zh-Hant": "回到原始資料與本步條件核對，不把單向推論誤稱等價。", "en": "Check against the original data and this step's premises; a one-way implication is not an equivalence." } }, "arithmetic": null }, { "id": "S003", "uses": [ "G001", "S002" ], "before": "point0 step1 product := mul(-3, 0)", "after": "point0 step1 product = 0", "relation": "calculation", "rule_id": "exact_rational_arithmetic", "conditions": [], "explanation": { "zh-Hant": "先將目前狀態乘以原始係數a，保留其正負號。", "en": "Multiply the current state by the original coefficient a,retaining its sign." }, "reverse_audit": { "kind": "premise_and_result_audit", "explanation": { "zh-Hant": "以精確有理數重算 point0 step1 product，不以小數近似替代。", "en": "Recompute point0 step1 product with exact rational arithmetic, not rounded decimals." } }, "arithmetic": { "operation": "mul", "inputs": [ "-3", "0" ], "output": "0", "label": "point0 step1 product" } }, { "id": "S004", "uses": [ "G001", "S003" ], "before": "point0 step1 affine value := sum(0, 6)", "after": "point0 step1 affine value = 6", "relation": "calculation", "rule_id": "exact_rational_arithmetic", "conditions": [], "explanation": { "zh-Hant": "再加上原始常數b，尚未把此整數當成狀態。", "en": "Then add the original constant b;this integer is not yet the canonical state." }, "reverse_audit": { "kind": "premise_and_result_audit", "explanation": { "zh-Hant": "以精確有理數重算 point0 step1 affine value，不以小數近似替代。", "en": "Recompute point0 step1 affine value with exact rational arithmetic, not rounded decimals." } }, "arithmetic": { "operation": "sum", "inputs": [ "0", "6" ], "output": "6", "label": "point0 step1 affine value" } }, { "id": "S005", "uses": [ "G001", "S004" ], "before": "Euclidean division of 6 by 7", "after": "6=0·7+6", "relation": "implies", "rule_id": "orbit_successor", "conditions": [], "explanation": { "zh-Hant": "用整除商與非負餘數驗算轉移；n>0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder0且0≤餘數0 and0≤remainder