第 19837 題：Fermat小定理

原題與已知條件

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

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

定義與適用範圍

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

• mko-fermat-little-theorem

逐步推導

source operation=flt-converse-counterexample;original snapshot and mathematics retained

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

ACTUAL integer modulus=561;complete trial range2..floor_sqrt=23

checked rows[divisor,quotient,remainder]=[[2, 280, 1], [3, 187, 0]];first exact factor=3;prime=否

original signed base=23;positive modulus=561;use nonnegative gcd inputs=[23, 561]

ALL Euclidean rows[left,right,q,r]=[[23, 561, 0, 23], [561, 23, 24, 9], [23, 9, 2, 5], [9, 5, 1, 4], [5, 4, 1, 1], [4, 1, 4, 0]];terminal nonnegative gcd=1;coprime=是

Fermat original signed base exact quotient := div(23, 561)

Fermat original signed base exact quotient = 23/561

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

Fermat original signed base floor quotient multiple = 0

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

Fermat original signed base normalized remainder = 23

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

value=q*modulus+remainder;normalized remainder=23 in[0,561)

Fermat original modular exponent:original normalized base=23;original exponent=560;modulus=561

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

Fermat original modular exponent bit0 current base square = 529

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

Fermat original modular exponent bit0 squared base reduction exact quotient = 529/561

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

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

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

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

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

value=q*modulus+remainder;normalized remainder=529 in[0,561)

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

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

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

Fermat original modular exponent bit1 current base square = 279841

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

Fermat original modular exponent bit1 squared base reduction exact quotient = 279841/561

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

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

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

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

Fermat original modular exponent bit1 squared base reduction:signed integer value=279841;positive modulus=561;exact quotient=279841/561;floor q=498

value=q*modulus+remainder;normalized remainder=463 in[0,561)

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

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

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

Fermat original modular exponent bit2 current base square = 214369

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

Fermat original modular exponent bit2 squared base reduction exact quotient = 214369/561

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

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

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

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

Fermat original modular exponent bit2 squared base reduction:signed integer value=214369;positive modulus=561;exact quotient=214369/561;floor q=382

value=q*modulus+remainder;normalized remainder=67 in[0,561)

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

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

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

Fermat original modular exponent bit3 current base square = 4489

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

Fermat original modular exponent bit3 squared base reduction exact quotient = 4489/561

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

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

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

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

Fermat original modular exponent bit3 squared base reduction:signed integer value=4489;positive modulus=561;exact quotient=4489/561;floor q=8

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

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

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

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

Fermat original modular exponent bit4 accumulator product = 1

Fermat original modular exponent bit4 accumulator reduction exact quotient := div(1, 561)

Fermat original modular exponent bit4 accumulator reduction exact quotient = 1/561

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

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

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

Fermat original modular exponent bit4 accumulator reduction normalized remainder = 1

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

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

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, 561)

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

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

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=561;exact quotient=1/561;floor q=0

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

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

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

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

Fermat original modular exponent bit5 accumulator product = 1

Fermat original modular exponent bit5 accumulator reduction exact quotient := div(1, 561)

Fermat original modular exponent bit5 accumulator reduction exact quotient = 1/561

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

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

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

Fermat original modular exponent bit5 accumulator reduction normalized remainder = 1

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

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

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, 561)

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

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

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=561;exact quotient=1/561;floor q=0

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

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

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

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, 561)

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

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

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=561;exact quotient=1/561;floor q=0

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

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

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

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

Fermat original modular exponent bit7 current base square = 1

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

Fermat original modular exponent bit7 squared base reduction exact quotient = 1/561

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

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

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

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

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

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

Fermat original modular exponent:step=7;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 bit8 current base square := mul(1, 1)

Fermat original modular exponent bit8 current base square = 1

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

Fermat original modular exponent bit8 squared base reduction exact quotient = 1/561

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

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

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

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

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

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

Fermat original modular exponent:step=8;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 bit9 accumulator product := mul(1, 1)

Fermat original modular exponent bit9 accumulator product = 1

Fermat original modular exponent bit9 accumulator reduction exact quotient := div(1, 561)

Fermat original modular exponent bit9 accumulator reduction exact quotient = 1/561

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

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

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

Fermat original modular exponent bit9 accumulator reduction normalized remainder = 1

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

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

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

Fermat original modular exponent bit9 current base square = 1

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

Fermat original modular exponent bit9 squared base reduction exact quotient = 1/561

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

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

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

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

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

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

Fermat original modular exponent:step=9;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^560 modulo561=1

ACTUAL composite modulus=561 certified by a trial factor;ORIGINAL base=23 coprime;computed a^(m-1) modulo m=1

THIS chosen composite/base pair passes the Fermat power test,but modulus is NOT prime;counterexample to converse ONLY

逐步反向核對

• S085 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S084 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S083 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S082 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S081 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit9 squared base reduction normalized remainder，不以小數近似替代。
• S080 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit9 squared base reduction floor quotient multiple，不以小數近似替代。
• S079 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit9 squared base reduction exact quotient，不以小數近似替代。
• S078 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit9 current base square，不以小數近似替代。
• S077 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S076 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit9 accumulator reduction normalized remainder，不以小數近似替代。
• S075 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit9 accumulator reduction floor quotient multiple，不以小數近似替代。
• S074 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit9 accumulator reduction exact quotient，不以小數近似替代。
• S073 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit9 accumulator product，不以小數近似替代。
• S072 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S071 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S070 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit8 squared base reduction normalized remainder，不以小數近似替代。
• S069 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit8 squared base reduction floor quotient multiple，不以小數近似替代。
• S068 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit8 squared base reduction exact quotient，不以小數近似替代。
• S067 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit8 current base square，不以小數近似替代。
• S066 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S065 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S064 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit7 squared base reduction normalized remainder，不以小數近似替代。
• S063 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit7 squared base reduction floor quotient multiple，不以小數近似替代。
• S062 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit7 squared base reduction exact quotient，不以小數近似替代。
• S061 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit7 current base square，不以小數近似替代。
• 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 — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S052 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 squared base reduction normalized remainder，不以小數近似替代。
• S051 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 squared base reduction floor quotient multiple，不以小數近似替代。
• S050 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 squared base reduction exact quotient，不以小數近似替代。
• S049 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 current base square，不以小數近似替代。
• S048 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S047 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 accumulator reduction normalized remainder，不以小數近似替代。
• S046 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 accumulator reduction floor quotient multiple，不以小數近似替代。
• S045 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 accumulator reduction exact quotient，不以小數近似替代。
• S044 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit5 accumulator product，不以小數近似替代。
• 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 — 以精確有理數重算 Fermat original modular exponent bit4 accumulator reduction normalized remainder，不以小數近似替代。
• S035 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit4 accumulator reduction floor quotient multiple，不以小數近似替代。
• S034 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit4 accumulator reduction exact quotient，不以小數近似替代。
• S033 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit4 accumulator product，不以小數近似替代。
• S032 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S031 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S030 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 squared base reduction normalized remainder，不以小數近似替代。
• S029 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 squared base reduction floor quotient multiple，不以小數近似替代。
• S028 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 squared base reduction exact quotient，不以小數近似替代。
• S027 · premise_and_result_audit — 以精確有理數重算 Fermat original modular exponent bit3 current base square，不以小數近似替代。
• 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 — 回到原始資料與本步條件核對，不把單向推論誤稱等價。

結論

(561, 23, 否, 是, 1, converse_false_composite_can_pass_Fermat_test)

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

本題覆核與來源綁定

覆核日期：2026-10-26

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