第 19896 題：Fermat小定理

原題與已知條件

exact modular exponentiation與明示prime或composite hypotheses。操作=flt-prime-coprime；資料={"p":73,"a":22}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

• G001 — exact modular exponentiation與明示prime或composite hypotheses。操作=flt-prime-coprime；資料={"p":73,"a":22}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

定義與適用範圍

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

• mko-fermat-little-theorem

逐步推導

source operation=flt-prime-coprime;original snapshot and mathematics retained

explicit ordered source output fields=[p, normalized_base, power_p_minus_1, congruence_certificate, boundary]

ACTUAL integer modulus=73;complete trial range2..floor_sqrt=8

checked rows[divisor,quotient,remainder]=[[2, 36, 1], [3, 24, 1], [4, 18, 1], [5, 14, 3], [6, 12, 1], [7, 10, 3], [8, 9, 1]];first exact factor=null;prime=是

original signed base=22;positive modulus=73;use nonnegative gcd inputs=[22, 73]

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

Fermat original signed base exact quotient := div(22, 73)

Fermat original signed base exact quotient = 22/73

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

Fermat original signed base floor quotient multiple = 0

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

Fermat original signed base normalized remainder = 22

Fermat original signed base:signed integer value=22;positive modulus=73;exact quotient=22/73;floor q=0

value=q*modulus+remainder;normalized remainder=22 in[0,73)

Fermat original modular exponent:original normalized base=22;original exponent=72;modulus=73

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(22, 22)

Fermat original modular exponent bit0 current base square = 484

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

Fermat original modular exponent bit0 squared base reduction exact quotient = 484/73

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

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

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

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

Fermat original modular exponent bit0 squared base reduction:signed integer value=484;positive modulus=73;exact quotient=484/73;floor q=6

value=q*modulus+remainder;normalized remainder=46 in[0,73)

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

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

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

Fermat original modular exponent bit1 current base square = 2116

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

Fermat original modular exponent bit1 squared base reduction exact quotient = 2116/73

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

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

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

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

Fermat original modular exponent bit1 squared base reduction:signed integer value=2116;positive modulus=73;exact quotient=2116/73;floor q=28

value=q*modulus+remainder;normalized remainder=72 in[0,73)

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

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

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

Fermat original modular exponent bit2 current base square = 5184

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

Fermat original modular exponent bit2 squared base reduction exact quotient = 5184/73

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

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

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

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

Fermat original modular exponent bit2 squared base reduction:signed integer value=5184;positive modulus=73;exact quotient=5184/73;floor q=71

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

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

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

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

Fermat original modular exponent bit3 accumulator product = 1

Fermat original modular exponent bit3 accumulator reduction exact quotient := div(1, 73)

Fermat original modular exponent bit3 accumulator reduction exact quotient = 1/73

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

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

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

Fermat original modular exponent bit3 accumulator reduction normalized remainder = 1

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

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

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

Fermat original modular exponent bit3 current base square = 1

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

Fermat original modular exponent bit3 squared base reduction exact quotient = 1/73

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

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

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

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

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

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

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

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

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

Fermat original modular exponent bit4 current base square = 1

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

Fermat original modular exponent bit4 squared base reduction exact quotient = 1/73

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

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

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

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

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

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

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

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

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

Fermat original modular exponent bit5 current base square = 1

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

Fermat original modular exponent bit5 squared base reduction exact quotient = 1/73

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

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

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

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

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

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

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

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

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

Fermat original modular exponent bit6 accumulator product = 1

Fermat original modular exponent bit6 accumulator reduction exact quotient := div(1, 73)

Fermat original modular exponent bit6 accumulator reduction exact quotient = 1/73

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

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

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

Fermat original modular exponent bit6 accumulator reduction normalized remainder = 1

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

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

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

Fermat original modular exponent bit6 current base square = 1

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

Fermat original modular exponent bit6 squared base reduction exact quotient = 1/73

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

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

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

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

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

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

Fermat original modular exponent:step=6;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^72 modulo73=1

Fermat actual unit inverse product := mul(22, 10)

Fermat actual unit inverse product = 220

Fermat actual inverse identity exact quotient := div(220, 73)

Fermat actual inverse identity exact quotient = 220/73

Fermat actual inverse identity floor quotient multiple := mul(3, 73)

Fermat actual inverse identity floor quotient multiple = 219

Fermat actual inverse identity normalized remainder := sub(220, 219)

Fermat actual inverse identity normalized remainder = 1

Fermat actual inverse identity:signed integer value=220;positive modulus=73;exact quotient=220/73;floor q=3

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

VERIFIED prime p=73;nonzero original base residue=22;ACTUAL inverse witness=10

multiplication r->a*r mod p permutes ALL nonzero residues1..p-1:inverse gives injectivity and finite self-injection gives surjectivity

same verified prime p=73;ALL nonzero residues permuted by multiplication by a=22

product over r=1..p-1 gives a^(p-1)*(p-1)! congruent to (p-1)!;EVERY factor is a prime-field unit,so factorial is a UNIT;cancel ONLY this nonzero unit to obtain a^(p-1) congruent1

逐步反向核對

• S068 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S067 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S066 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S065 · premise_and_result_audit — 以精確有理數重算 Fermat actual inverse identity normalized remainder，不以小數近似替代。
• S064 · premise_and_result_audit — 以精確有理數重算 Fermat actual inverse identity floor quotient multiple，不以小數近似替代。
• S063 · premise_and_result_audit — 以精確有理數重算 Fermat actual inverse identity exact quotient，不以小數近似替代。
• S062 · premise_and_result_audit — 以精確有理數重算 Fermat actual unit inverse product，不以小數近似替代。
• S061 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S060 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S059 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S058 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit6 squared base reduction normalized remainder，不以小數近似替代。
• S057 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit6 squared base reduction floor quotient multiple，不以小數近似替代。
• S056 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit6 squared base reduction exact quotient，不以小數近似替代。
• S055 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit6 current base square，不以小數近似替代。
• S054 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S053 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit6 accumulator reduction normalized remainder，不以小數近似替代。
• S052 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit6 accumulator reduction floor quotient multiple，不以小數近似替代。
• S051 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit6 accumulator reduction exact quotient，不以小數近似替代。
• S050 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit6 accumulator product，不以小數近似替代。
• S049 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S048 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S047 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 squared base reduction normalized remainder，不以小數近似替代。
• S046 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 squared base reduction floor quotient multiple，不以小數近似替代。
• S045 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 squared base reduction exact quotient，不以小數近似替代。
• S044 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 current base square，不以小數近似替代。
• S043 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S042 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S041 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit4 squared base reduction normalized remainder，不以小數近似替代。
• S040 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit4 squared base reduction floor quotient multiple，不以小數近似替代。
• S039 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit4 squared base reduction exact quotient，不以小數近似替代。
• S038 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit4 current base square，不以小數近似替代。
• S037 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S036 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S035 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 squared base reduction normalized remainder，不以小數近似替代。
• S034 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 squared base reduction floor quotient multiple，不以小數近似替代。
• S033 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 squared base reduction exact quotient，不以小數近似替代。
• S032 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 current base square，不以小數近似替代。
• S031 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S030 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 accumulator reduction normalized remainder，不以小數近似替代。
• S029 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 accumulator reduction floor quotient multiple，不以小數近似替代。
• S028 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 accumulator reduction exact quotient，不以小數近似替代。
• S027 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 accumulator product，不以小數近似替代。
• S026 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S025 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S024 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 squared base reduction normalized remainder，不以小數近似替代。
• S023 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 squared base reduction floor quotient multiple，不以小數近似替代。
• S022 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 squared base reduction exact quotient，不以小數近似替代。
• S021 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit2 current base square，不以小數近似替代。
• 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 — 回到原始資料與本步條件核對，不把單向推論誤稱等價。

結論

(73, 22, 1, 是, prime_coprime_form)

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

本題覆核與來源綁定

覆核日期：2026-10-26

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