第 19857 題：Fermat小定理

原題與已知條件

exact modular exponentiation與明示prime或composite hypotheses。操作=flt-hypothesis-audit；資料={"modulus":10,"a":8}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

• G001 — exact modular exponentiation與明示prime或composite hypotheses。操作=flt-hypothesis-audit；資料={"modulus":10,"a":8}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

定義與適用範圍

沿用原題明示的論域、假設與來源 MKO 定義。本題已完成第二對話數理與中英語義覆核，並由原始參數逐題獨立重算模型、答案與每個算術步驟；原題仍為 candidate。

• mko-fermat-little-theorem

逐步推導

source operation=flt-hypothesis-audit;original snapshot and mathematics retained

explicit ordered source output fields=[modulus, original_base, prime, coprime, coprime_form_applicable, power_modulus_minus_1, boundary]

ACTUAL integer modulus=10;complete trial range2..floor_sqrt=3

checked rows[divisor,quotient,remainder]=[[2, 5, 0]];first exact factor=2;prime=否

original signed base=8;positive modulus=10;use nonnegative gcd inputs=[8, 10]

ALL Euclidean rows[left,right,q,r]=[[8, 10, 0, 8], [10, 8, 1, 2], [8, 2, 4, 0]];terminal nonnegative gcd=2;coprime=否

Fermat original signed base exact quotient := div(8, 10)

Fermat original signed base exact quotient = 4/5

Fermat original signed base floor quotient multiple := mul(0, 10)

Fermat original signed base floor quotient multiple = 0

Fermat original signed base normalized remainder := sub(8, 0)

Fermat original signed base normalized remainder = 8

Fermat original signed base:signed integer value=8;positive modulus=10;exact quotient=4/5;floor q=0

value=q*modulus+remainder;normalized remainder=8 in[0,10)

Fermat original modular exponent:original normalized base=8;original exponent=9;modulus=10

initialize accumulator1,current_base=base,remaining=exponent;invariant accumulator*current_base^remaining congruent to original power

Fermat original modular exponent bit0 accumulator product := mul(1, 8)

Fermat original modular exponent bit0 accumulator product = 8

Fermat original modular exponent bit0 accumulator reduction exact quotient := div(8, 10)

Fermat original modular exponent bit0 accumulator reduction exact quotient = 4/5

Fermat original modular exponent bit0 accumulator reduction floor quotient multiple := mul(0, 10)

Fermat original modular exponent bit0 accumulator reduction floor quotient multiple = 0

Fermat original modular exponent bit0 accumulator reduction normalized remainder := sub(8, 0)

Fermat original modular exponent bit0 accumulator reduction normalized remainder = 8

Fermat original modular exponent bit0 accumulator reduction:signed integer value=8;positive modulus=10;exact quotient=4/5;floor q=0

value=q*modulus+remainder;normalized remainder=8 in[0,10)

Fermat original modular exponent bit0 current base square := mul(8, 8)

Fermat original modular exponent bit0 current base square = 64

Fermat original modular exponent bit0 squared base reduction exact quotient := div(64, 10)

Fermat original modular exponent bit0 squared base reduction exact quotient = 32/5

Fermat original modular exponent bit0 squared base reduction floor quotient multiple := mul(6, 10)

Fermat original modular exponent bit0 squared base reduction floor quotient multiple = 60

Fermat original modular exponent bit0 squared base reduction normalized remainder := sub(64, 60)

Fermat original modular exponent bit0 squared base reduction normalized remainder = 4

Fermat original modular exponent bit0 squared base reduction:signed integer value=64;positive modulus=10;exact quotient=32/5;floor q=6

value=q*modulus+remainder;normalized remainder=4 in[0,10)

Fermat original modular exponent:step=0;previous[accumulator,base,exponent]=[1, 8, 9];low bit=1

next[accumulator,base,exponent]=[8, 4, 4];split exponent=2*q+bit preserves original-power invariant

Fermat original modular exponent bit1 current base square := mul(4, 4)

Fermat original modular exponent bit1 current base square = 16

Fermat original modular exponent bit1 squared base reduction exact quotient := div(16, 10)

Fermat original modular exponent bit1 squared base reduction exact quotient = 8/5

Fermat original modular exponent bit1 squared base reduction floor quotient multiple := mul(1, 10)

Fermat original modular exponent bit1 squared base reduction floor quotient multiple = 10

Fermat original modular exponent bit1 squared base reduction normalized remainder := sub(16, 10)

Fermat original modular exponent bit1 squared base reduction normalized remainder = 6

Fermat original modular exponent bit1 squared base reduction:signed integer value=16;positive modulus=10;exact quotient=8/5;floor q=1

value=q*modulus+remainder;normalized remainder=6 in[0,10)

Fermat original modular exponent:step=1;previous[accumulator,base,exponent]=[8, 4, 4];low bit=0

next[accumulator,base,exponent]=[8, 6, 2];split exponent=2*q+bit preserves original-power invariant

Fermat original modular exponent bit2 current base square := mul(6, 6)

Fermat original modular exponent bit2 current base square = 36

Fermat original modular exponent bit2 squared base reduction exact quotient := div(36, 10)

Fermat original modular exponent bit2 squared base reduction exact quotient = 18/5

Fermat original modular exponent bit2 squared base reduction floor quotient multiple := mul(3, 10)

Fermat original modular exponent bit2 squared base reduction floor quotient multiple = 30

Fermat original modular exponent bit2 squared base reduction normalized remainder := sub(36, 30)

Fermat original modular exponent bit2 squared base reduction normalized remainder = 6

Fermat original modular exponent bit2 squared base reduction:signed integer value=36;positive modulus=10;exact quotient=18/5;floor q=3

value=q*modulus+remainder;normalized remainder=6 in[0,10)

Fermat original modular exponent:step=2;previous[accumulator,base,exponent]=[8, 6, 2];low bit=0

next[accumulator,base,exponent]=[8, 6, 1];split exponent=2*q+bit preserves original-power invariant

Fermat original modular exponent bit3 accumulator product := mul(8, 6)

Fermat original modular exponent bit3 accumulator product = 48

Fermat original modular exponent bit3 accumulator reduction exact quotient := div(48, 10)

Fermat original modular exponent bit3 accumulator reduction exact quotient = 24/5

Fermat original modular exponent bit3 accumulator reduction floor quotient multiple := mul(4, 10)

Fermat original modular exponent bit3 accumulator reduction floor quotient multiple = 40

Fermat original modular exponent bit3 accumulator reduction normalized remainder := sub(48, 40)

Fermat original modular exponent bit3 accumulator reduction normalized remainder = 8

Fermat original modular exponent bit3 accumulator reduction:signed integer value=48;positive modulus=10;exact quotient=24/5;floor q=4

value=q*modulus+remainder;normalized remainder=8 in[0,10)

Fermat original modular exponent bit3 current base square := mul(6, 6)

Fermat original modular exponent bit3 current base square = 36

Fermat original modular exponent bit3 squared base reduction exact quotient := div(36, 10)

Fermat original modular exponent bit3 squared base reduction exact quotient = 18/5

Fermat original modular exponent bit3 squared base reduction floor quotient multiple := mul(3, 10)

Fermat original modular exponent bit3 squared base reduction floor quotient multiple = 30

Fermat original modular exponent bit3 squared base reduction normalized remainder := sub(36, 30)

Fermat original modular exponent bit3 squared base reduction normalized remainder = 6

Fermat original modular exponent bit3 squared base reduction:signed integer value=36;positive modulus=10;exact quotient=18/5;floor q=3

value=q*modulus+remainder;normalized remainder=6 in[0,10)

Fermat original modular exponent:step=3;previous[accumulator,base,exponent]=[8, 6, 1];low bit=1

next[accumulator,base,exponent]=[8, 6, 0];split exponent=2*q+bit preserves original-power invariant

Fermat original modular exponent:remaining exponent0;final normalized accumulator=8

EXACT original base^9 modulo10=8

ACTUAL modulus=10;ORIGINAL signed base=8;prime=否;coprime=否;actual power residue=8

prime-coprime applicability=否;failed hypotheses do NOT force actual residue!=1;one successful residue does NOT prove prime

逐步反向核對

• S044 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S043 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S042 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S041 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S040 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 squared base reduction normalized remainder，不以小數近似替代。
• S039 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 squared base reduction floor quotient multiple，不以小數近似替代。
• S038 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 squared base reduction exact quotient，不以小數近似替代。
• S037 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 current base square，不以小數近似替代。
• S036 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S035 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 accumulator reduction normalized remainder，不以小數近似替代。
• S034 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 accumulator reduction floor quotient multiple，不以小數近似替代。
• S033 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 accumulator reduction exact quotient，不以小數近似替代。
• S032 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 accumulator product，不以小數近似替代。
• S031 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S030 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S029 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 squared base reduction normalized remainder，不以小數近似替代。
• S028 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 squared base reduction floor quotient multiple，不以小數近似替代。
• S027 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 squared base reduction exact quotient，不以小數近似替代。
• S026 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 current base square，不以小數近似替代。
• S025 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S024 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S023 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit1 squared base reduction normalized remainder，不以小數近似替代。
• S022 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit1 squared base reduction floor quotient multiple，不以小數近似替代。
• S021 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit1 squared base reduction exact quotient，不以小數近似替代。
• S020 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit1 current base square，不以小數近似替代。
• S019 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S018 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S017 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 squared base reduction normalized remainder，不以小數近似替代。
• S016 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 squared base reduction floor quotient multiple，不以小數近似替代。
• S015 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 squared base reduction exact quotient，不以小數近似替代。
• S014 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 current base square，不以小數近似替代。
• S013 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S012 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 accumulator reduction normalized remainder，不以小數近似替代。
• S011 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 accumulator reduction floor quotient multiple，不以小數近似替代。
• S010 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 accumulator reduction exact quotient，不以小數近似替代。
• S009 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 accumulator product，不以小數近似替代。
• S008 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S007 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S006 · premise_and_result_audit — 以精確有理數重算 Fermat original signed base normalized remainder，不以小數近似替代。
• S005 · premise_and_result_audit — 以精確有理數重算 Fermat original signed base floor quotient multiple，不以小數近似替代。
• S004 · premise_and_result_audit — 以精確有理數重算 Fermat original signed base exact quotient，不以小數近似替代。
• S003 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S002 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S001 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。

結論

(10, 8, 否, 否, 否, 8, coprime_form_not_applicable_without_both_hypotheses)

依上列完整代值及條件核對得到原題答案；原題編號、格式與狀態保持不變。

本題覆核與來源綁定

覆核日期：2026-10-26

原題、答案、步驟表達式、數值 AST 與既有歷史保持原樣；原來的候選狀態屬於來源歷史，不覆寫為形式化證明。