{
  "schema_version": "ocme-reviewed-question-reader-v1",
  "question_id": "q-20261003-r03-factorization-0068",
  "pilot_number": "R0019-10093",
  "number": 10093,
  "family_id": "qf-factorization-product-coefficient",
  "title": {
    "zh-Hant": "第 10093 題：因子乘積的指定係數",
    "en": "Question 10093: Specified Coefficient of a Factor Product"
  },
  "original_question": {
    "schema_version": "ocme-question-v0.1",
    "id": "q-20261003-r03-factorization-0068",
    "batch_id": "batch-20261003-r03-factorization-foundations",
    "language": "zh-Hant",
    "source_mko_ids": [
      "mko-factorization"
    ],
    "title_zh": "因子乘積的指定係數",
    "stem_zh": "在 Q[x] 中，係數向量由低次至高次排列。[12, 1, 1] 與 [19, -1] 的乘積中，x^5 的係數是多少？",
    "answer": {
      "kind": "numeric",
      "value": "0",
      "explanation_zh": "a_5=0。把指數和為 5 的係數乘積相加；乘積完整係數為 [228, 7, 18, -1]。"
    },
    "difficulty": {
      "band": "upper_secondary",
      "level": 3,
      "skills": [
        "因子乘積的指定係數"
      ]
    },
    "variant": {
      "family_id": "qf-factorization-product-coefficient",
      "seed": 202610033068,
      "parameters": {
        "left": [
          12,
          1,
          1
        ],
        "right": [
          19,
          -1
        ],
        "k": 5,
        "operation": "product_coefficient",
        "semantic_template": "qf-factorization-product-coefficient/{\"k\":5,\"left\":[\"12\",\"1\",\"1\"],\"operation\":\"product_coefficient\",\"right\":[\"19\",\"-1\"]}"
      }
    },
    "verification": {
      "status": "candidate",
      "checks": [
        "producer_exact_integer_rational_arithmetic",
        "producer_source_snapshot_check",
        "producer_substantive_template_deduplication"
      ],
      "warning_zh": "僅為獨立出題上下文的候選與自檢；主架構者仍須獨立驗收，不構成人工審定或一般形式證明。"
    },
    "provenance": {
      "generator_role": "question_producer",
      "generator_model": "Codex independent peer (inherited model; exact runtime model not exposed)",
      "generated_at": "2026-10-03",
      "contract_version": "ocme-question-factory-v0.1"
    }
  },
  "original_english_edition": {
    "schema_version": "ocme-question-localization-v0.1",
    "question_id": "q-20261003-r03-factorization-0068",
    "batch_id": "batch-20261003-r03-factorization-foundations",
    "locale": "en",
    "translation_state": "ai_candidate",
    "source": {
      "question_sha256": "138691b1948e8ebf591b15457f90b84d99357674edeff86b35a208c82b275c33",
      "family_id": "qf-factorization-product-coefficient",
      "seed": 202610033068,
      "semantic_template": "qf-factorization-product-coefficient/{\"k\":5,\"left\":[\"12\",\"1\",\"1\"],\"operation\":\"product_coefficient\",\"right\":[\"19\",\"-1\"]}"
    },
    "fields": {
      "title": "Specified Coefficient of a Factor Product",
      "stem": "In Q[x], coefficient vectors are ordered from lowest to highest power. Find the coefficient of x^5 in the product of [12, 1, 1] and [19, -1].",
      "answer": {
        "kind": "numeric",
        "value": "0",
        "explanation": "Sum products of coefficients whose indices add to 5. The exact product coefficient is a_5=0."
      },
      "skills": [
        "Specified Coefficient of a Factor Product"
      ],
      "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": "在 Q[x] 中，係數向量由低次至高次排列。[12, 1, 1] 與 [19, -1] 的乘積中，x^5 的係數是多少？",
        "en": "In Q[x], coefficient vectors are ordered from lowest to highest power. Find the coefficient of x^5 in the product of [12, 1, 1] and [19, -1]."
      }
    }
  ],
  "steps": [
    {
      "id": "S001",
      "uses": [
        "G001"
      ],
      "before": "Q[x];ascending coefficients;input vectors may have trailing zeros",
      "after": "equality uses every normalized coefficient,not numerical sampling",
      "relation": "implies",
      "rule_id": "factorization_coefficient_identity_scope",
      "conditions": [],
      "explanation": {
        "zh-Hant": "保留原因子順序與原向量，規範只刪高次尾零；不要依semantic身份排序交換原輸入，也不以單點相等代替多項式相等。",
        "en": "Preserve the original factor order and vectors.Normalization removes only trailing high-power zeros;do not reorder source factors by semantic identity or infer polynomial equality from one point."
      },
      "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": "raw left=[12, 1, 1];raw right=[19, -1]",
      "after": "normalized left=[12, 1, 1];normalized right=[19, -1]",
      "relation": "implies",
      "rule_id": "factor_vectors_trailing_zero_normalization",
      "conditions": [],
      "explanation": {
        "zh-Hant": "只刪末端零，不刪中間零，也不交換兩個向量；空向量與全零向量都代表零。",
        "en": "Remove trailing zeros only,not internal zeros or the original vector order.Empty and all-zero vectors both represent zero."
      },
      "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": "power k=5;left=[12, 1, 1];right=[19, -1]",
      "after": "all index pairs i+j=k=[]",
      "relation": "implies",
      "rule_id": "product_coefficient_complete_index_pairs",
      "conditions": [],
      "explanation": {
        "zh-Hant": "升冪向量的索引就是次數；只收i+j=k且兩索引各自合法的全部項，不把乘法當逐項相乘。",
        "en": "Ascending-vector indices are powers.Collect every valid pair with i+j=k;polynomial multiplication is not entrywise multiplication."
      },
      "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": "S004",
      "uses": [
        "G001",
        "S003"
      ],
      "before": "power k=5;no valid contributing index pairs",
      "after": "coefficient=0",
      "relation": "implies",
      "rule_id": "empty_coefficient_sum_zero",
      "conditions": [],
      "explanation": {
        "zh-Hant": "沒有符合指數和的項時，空和為0，不能讀負索引或補造高次係數。",
        "en": "With no contributing pair the empty sum is0.Do not use negative indexing or invent a higher coefficient."
      },
      "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
    }
  ],
  "math_model": {
    "result": "0"
  },
  "conclusion": {
    "canonical_value": "0",
    "explanation": {
      "zh-Hant": "依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。",
      "en": "The full substitutions and premise checks give the original answer; source identity,format and status are unchanged."
    }
  },
  "definition_note": {
    "zh-Hant": "沿用原題明示的論域、假設與來源 MKO 定義。本題已完成第二對話數理與中英語義覆核，並由原始參數逐題獨立重算模型、答案與每個算術步驟；原題仍為 candidate。",
    "en": "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."
  },
  "source": {
    "input_commit": "0f7be61e2c22317a4075561dc822c87d881a50db",
    "question_binding": {
      "batch_id": "batch-20261003-r03-factorization-foundations",
      "batch_path": "public/data/questions/batches/batch-20261003-r03-factorization-foundations/questions.jsonl",
      "batch_sha256": "219ab610272e69af0c134f62a7796121c871cf30cb8a070384b366251b557e3f",
      "original_line": 68,
      "original_line_sha256": "dfd5ca6a1d8c056e7606dccc04746c84112fc4ba416f5612e269accf53056852",
      "question_compact_sha256": "138691b1948e8ebf591b15457f90b84d99357674edeff86b35a208c82b275c33",
      "english_row_compact_sha256": "51566eae956f64169df36d6541fc927d8e79c4a66aaf60e3e18e1fe9b59ec942",
      "english_manifest_path": "public/data/i18n/editions/batch-20261003-r03-factorization-foundations.en.json",
      "english_rows_path": "public/data/i18n/questions/batch-20261003-r03-factorization-foundations.en.jsonl"
    },
    "mko_bindings": {
      "mko-factorization": {
        "sha256": "375bd5e9c171dd33297e9e1954a6c9c2b48d97cebbbc4dd93b44c36108f04015",
        "english_sha256": "a24152abff47aa4af453747775e20a1c3ccccf16231b2c4d63aa1d68f06febf7",
        "original_path": "public/data/mko/factorization.json",
        "english_path": "public/data/i18n/editions/mko-factorization.en.json"
      }
    },
    "selected_manifest_sha256": "5233edba9654a6cffd8b6b2d83c932f82ded15f9c0b7c733bd049943e672acff",
    "selected_part_sha256": "7359cb2346bdb6bf38b7ca4a5fd5b5a99c3007a711f34346754d57b77b2dfcc8",
    "original_candidate_sha256": "b771fb27afa740df8d50b4ccb8611097be0f70d8cf3e10e8136d56b525343582",
    "original_candidate_line_sha256": "b771fb27afa740df8d50b4ccb8611097be0f70d8cf3e10e8136d56b525343582"
  },
  "historical_source_state": {
    "review_state": {
      "derivation": "candidate_authored_and_locally_checked",
      "source_question_state": "candidate",
      "independent_AI_or_human_review": "NOT_PERFORMED",
      "formalization": "not_formalized",
      "Lean": "NOT_RUN"
    },
    "scope_note": {
      "zh-Hant": "來源綁定教學推導候選；精確核對不等於獨立AI／人工審查或一般形式證明。原題、答案、MKO、公式、AST與歷史不變。",
      "en": "Source-bound pedagogical derivation candidate.Exact checking is not independent AI/human review or general formal proof.Original questions,answers,MKOs,formulas,ASTs and history remain unchanged."
    },
    "label": "Frozen producer metadata; current per-question review is separate below."
  },
  "revision": {
    "id": "review-20261026-006-p20",
    "review_date": "2026-10-26",
    "owner_authorized_reader_publication": true,
    "scope": "One hundred sixty family prototypes and their mathematical/bilingual reasoning variants, stems, boundary statements and every distinct explanation shape were reviewed in a context independent of the producer; parameter substitutions, source bindings, full math models, both answer strings and every arithmetic step were independently reconstructed per question from the original parameters only, with negative controls. This grouped method does not claim a separate literal AI reading of every repeated sentence or an extra AI voter.",
    "review_receipts": {
      "semantic_review_sha256": "eeb35dc5daab92234bf72827627392b47f38ead4cfb574d4373bebc43c09fbf5",
      "question_first_witness_sha256": "3cf8e0d3a00b0df1994db2bfde81f4a31b382e170bdda83ea3d0b68da64e8419"
    },
    "status": "second_context_reviewed",
    "mathematical_semantics": true,
    "bilingual_semantics": true,
    "steps_reviewed": 4,
    "method": "family_template_semantic_review_plus_independent_per_instance_reconstruction",
    "exact_question_first_check": {
      "model_sha256": "4c1639e6caa4263d3ad13cd60f7f008fb373031632c9a01c5745f1b87820abbb",
      "arithmetic_steps": 0
    },
    "uses_answer_as_premise": false,
    "human_review": "NOT_PERFORMED",
    "formalization": "not_formalized",
    "Lean": "NOT_RUN",
    "Canonical_truth_promotion": false,
    "authority": "Owner-authorized reviewed reader publication; original question/candidate states remain historical and unchanged."
  }
}