第 19852 題：Fermat小定理

原題與已知條件

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

• G001 — exact modular exponentiation與明示prime或composite hypotheses。操作=flt-hypothesis-audit；資料={"modulus":5,"a":-3}。請依 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=5;complete trial range2..floor_sqrt=2

checked rows[divisor,quotient,remainder]=[[2, 2, 1]];first exact factor=null;prime=是

original signed base=-3;positive modulus=5;use nonnegative gcd inputs=[3, 5]

ALL Euclidean rows[left,right,q,r]=[[3, 5, 0, 3], [5, 3, 1, 2], [3, 2, 1, 1], [2, 1, 2, 0]];terminal nonnegative gcd=1;coprime=是

Fermat original signed base exact quotient := div(-3, 5)

Fermat original signed base exact quotient = -3/5

Fermat original signed base floor quotient multiple := mul(-1, 5)

Fermat original signed base floor quotient multiple = -5

Fermat original signed base normalized remainder := sub(-3, -5)

Fermat original signed base normalized remainder = 2

Fermat original signed base:signed integer value=-3;positive modulus=5;exact quotient=-3/5;floor q=-1

value=q*modulus+remainder;normalized remainder=2 in[0,5)

Fermat original modular exponent:original normalized base=2;original exponent=4;modulus=5

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

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

Fermat original modular exponent bit0 current base square = 4

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

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

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

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

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

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

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

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

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

next[accumulator,base,exponent]=[1, 4, 2];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, 5)

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

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

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

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

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

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

value=q*modulus+remainder;normalized remainder=1 in[0,5)

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

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

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

Fermat original modular exponent bit2 accumulator product = 1

Fermat original modular exponent bit2 accumulator reduction exact quotient := div(1, 5)

Fermat original modular exponent bit2 accumulator reduction exact quotient = 1/5

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

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

Fermat original modular exponent bit2 accumulator reduction normalized remainder := sub(1, 0)

Fermat original modular exponent bit2 accumulator reduction normalized remainder = 1

Fermat original modular exponent bit2 accumulator reduction:signed integer value=1;positive modulus=5;exact quotient=1/5;floor q=0

value=q*modulus+remainder;normalized remainder=1 in[0,5)

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

Fermat original modular exponent bit2 current base square = 1

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

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

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

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

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

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

Fermat original modular exponent bit2 squared base reduction:signed integer value=1;positive modulus=5;exact quotient=1/5;floor q=0

value=q*modulus+remainder;normalized remainder=1 in[0,5)

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

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

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

EXACT original base^4 modulo5=1

ACTUAL modulus=5;ORIGINAL signed base=-3;prime=是;coprime=是;actual power residue=1

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

逐步反向核對

• S033 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S032 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• 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 — 以精確有理數重算 Fermat original modular exponent bit2 accumulator reduction normalized remainder，不以小數近似替代。
• S023 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 accumulator reduction floor quotient multiple，不以小數近似替代。
• S022 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 accumulator reduction exact quotient，不以小數近似替代。
• S021 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 accumulator product，不以小數近似替代。
• S020 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S019 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S018 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit1 squared base reduction normalized remainder，不以小數近似替代。
• S017 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit1 squared base reduction floor quotient multiple，不以小數近似替代。
• S016 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit1 squared base reduction exact quotient，不以小數近似替代。
• S015 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit1 current base square，不以小數近似替代。
• S014 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S013 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S012 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 squared base reduction normalized remainder，不以小數近似替代。
• S011 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 squared base reduction floor quotient multiple，不以小數近似替代。
• S010 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 squared base reduction exact quotient，不以小數近似替代。
• S009 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit0 current base square，不以小數近似替代。
• 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 — 回到原始資料與本步條件核對，不把單向推論誤稱等價。

結論

(5, -3, 是, 是, 是, 1, coprime_form_not_applicable_without_both_hypotheses)

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

本題覆核與來源綁定

覆核日期：2026-10-26

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