第 20083 題：Euler定理

原題與已知條件

n大於等於2、exact gcd、phi與安全modular exponentiation。操作=eulerthm-unit-permutation；資料={"n":12,"a":11}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

• G001 — n大於等於2、exact gcd、phi與安全modular exponentiation。操作=eulerthm-unit-permutation；資料={"n":12,"a":11}。請依 exact_ordered_tuple_declared_by_interface 欄序回答。

定義與適用範圍

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

• mko-euler-theorem-number-theory

逐步推導

source operation=eulerthm-unit-permutation;original snapshot and mathematics retained

explicit ordered source output fields=[units, sorted_mapped_units, permutation, certificate]

Euler ORIGINAL signed base normalization exact quotient := div(11, 12)

Euler ORIGINAL signed base normalization exact quotient = 11/12

Euler ORIGINAL signed base normalization floor quotient multiple := mul(0, 12)

Euler ORIGINAL signed base normalization floor quotient multiple = 0

Euler ORIGINAL signed base normalization normalized remainder := sub(11, 0)

Euler ORIGINAL signed base normalization normalized remainder = 11

Euler ORIGINAL signed base normalization:ORIGINAL signed integer=11;modulus=12;exact ratio=11/12;floor quotient=0

value=q*n+remainder;normalized residue=11 in[0,12);same congruence class,NOT absolute-value replacement

Euler ORIGINAL base applicability gcd:ORIGINAL gcd inputs=[11, 12];nonnegative initial pair=[11, 12]

ALL exact Euclidean rows[left,right,q,r]=[[11, 12, 0, 11], [12, 11, 1, 1], [11, 1, 11, 0]];terminal gcd=1

Euler residue representative0:ORIGINAL gcd inputs=[0, 12];nonnegative initial pair=[0, 12]

ALL exact Euclidean rows[left,right,q,r]=[[0, 12, 0, 0]];terminal gcd=12

Euler residue representative1:ORIGINAL gcd inputs=[1, 12];nonnegative initial pair=[1, 12]

ALL exact Euclidean rows[left,right,q,r]=[[1, 12, 0, 1], [12, 1, 12, 0]];terminal gcd=1

Euler residue representative2:ORIGINAL gcd inputs=[2, 12];nonnegative initial pair=[2, 12]

ALL exact Euclidean rows[left,right,q,r]=[[2, 12, 0, 2], [12, 2, 6, 0]];terminal gcd=2

Euler residue representative3:ORIGINAL gcd inputs=[3, 12];nonnegative initial pair=[3, 12]

ALL exact Euclidean rows[left,right,q,r]=[[3, 12, 0, 3], [12, 3, 4, 0]];terminal gcd=3

Euler residue representative4:ORIGINAL gcd inputs=[4, 12];nonnegative initial pair=[4, 12]

ALL exact Euclidean rows[left,right,q,r]=[[4, 12, 0, 4], [12, 4, 3, 0]];terminal gcd=4

Euler residue representative5:ORIGINAL gcd inputs=[5, 12];nonnegative initial pair=[5, 12]

ALL exact Euclidean rows[left,right,q,r]=[[5, 12, 0, 5], [12, 5, 2, 2], [5, 2, 2, 1], [2, 1, 2, 0]];terminal gcd=1

Euler residue representative6:ORIGINAL gcd inputs=[6, 12];nonnegative initial pair=[6, 12]

ALL exact Euclidean rows[left,right,q,r]=[[6, 12, 0, 6], [12, 6, 2, 0]];terminal gcd=6

Euler residue representative7:ORIGINAL gcd inputs=[7, 12];nonnegative initial pair=[7, 12]

ALL exact Euclidean rows[left,right,q,r]=[[7, 12, 0, 7], [12, 7, 1, 5], [7, 5, 1, 2], [5, 2, 2, 1], [2, 1, 2, 0]];terminal gcd=1

Euler residue representative8:ORIGINAL gcd inputs=[8, 12];nonnegative initial pair=[8, 12]

ALL exact Euclidean rows[left,right,q,r]=[[8, 12, 0, 8], [12, 8, 1, 4], [8, 4, 2, 0]];terminal gcd=4

Euler residue representative9:ORIGINAL gcd inputs=[9, 12];nonnegative initial pair=[9, 12]

ALL exact Euclidean rows[left,right,q,r]=[[9, 12, 0, 9], [12, 9, 1, 3], [9, 3, 3, 0]];terminal gcd=3

Euler residue representative10:ORIGINAL gcd inputs=[10, 12];nonnegative initial pair=[10, 12]

ALL exact Euclidean rows[left,right,q,r]=[[10, 12, 0, 10], [12, 10, 1, 2], [10, 2, 5, 0]];terminal gcd=2

Euler residue representative11:ORIGINAL gcd inputs=[11, 12];nonnegative initial pair=[11, 12]

ALL exact Euclidean rows[left,right,q,r]=[[11, 12, 0, 11], [12, 11, 1, 1], [11, 1, 11, 0]];terminal gcd=1

Euler complete reduced residue count phi := sum(1, 1, 1, 1)

Euler complete reduced residue count phi = 4

COMPLETE original residue carrier0..11;ALL [representative,gcd,unit] rows=[[0, 12, 否], [1, 1, 是], [2, 2, 否], [3, 3, 否], [4, 4, 否], [5, 1, 是], [6, 6, 否], [7, 1, 是], [8, 4, 否], [9, 3, 否], [10, 2, 否], [11, 1, 是]]

increasing COMPLETE U(n)=[1, 5, 7, 11];phi(n)=4;source count over1..n agrees because0 and n are BOTH nonunits for n>=2

Euler ACTUAL base-unit inverse product := mul(11, 11)

Euler ACTUAL base-unit inverse product = 121

Euler ACTUAL inverse check exact quotient := div(121, 12)

Euler ACTUAL inverse check exact quotient = 121/12

Euler ACTUAL inverse check floor quotient multiple := mul(10, 12)

Euler ACTUAL inverse check floor quotient multiple = 120

Euler ACTUAL inverse check normalized remainder := sub(121, 120)

Euler ACTUAL inverse check normalized remainder = 1

Euler ACTUAL inverse check:ORIGINAL signed integer=121;modulus=12;exact ratio=121/12;floor quotient=10

value=q*n+remainder;normalized residue=1 in[0,12);same congruence class,NOT absolute-value replacement

ACTUAL modulus n=12;gcd(original a=11,n)=1;normalized base=11;ACTUAL inverse=11;COMPLETE U(n)=[1, 5, 7, 11]

for ANY r in U(n),a*r remains a unit;actual inverse makes multiplication injective;finite self-injection on U(n) is surjective,so a*U(n)=U(n)

Euler ORIGINAL a times unit representative1 := mul(11, 1)

Euler ORIGINAL a times unit representative1 = 11

Euler unit representative1 raw image exact quotient := div(11, 12)

Euler unit representative1 raw image exact quotient = 11/12

Euler unit representative1 raw image floor quotient multiple := mul(0, 12)

Euler unit representative1 raw image floor quotient multiple = 0

Euler unit representative1 raw image normalized remainder := sub(11, 0)

Euler unit representative1 raw image normalized remainder = 11

Euler unit representative1 raw image:ORIGINAL signed integer=11;modulus=12;exact ratio=11/12;floor quotient=0

value=q*n+remainder;normalized residue=11 in[0,12);same congruence class,NOT absolute-value replacement

Euler ORIGINAL a times unit representative5 := mul(11, 5)

Euler ORIGINAL a times unit representative5 = 55

Euler unit representative5 raw image exact quotient := div(55, 12)

Euler unit representative5 raw image exact quotient = 55/12

Euler unit representative5 raw image floor quotient multiple := mul(4, 12)

Euler unit representative5 raw image floor quotient multiple = 48

Euler unit representative5 raw image normalized remainder := sub(55, 48)

Euler unit representative5 raw image normalized remainder = 7

Euler unit representative5 raw image:ORIGINAL signed integer=55;modulus=12;exact ratio=55/12;floor quotient=4

value=q*n+remainder;normalized residue=7 in[0,12);same congruence class,NOT absolute-value replacement

Euler ORIGINAL a times unit representative7 := mul(11, 7)

Euler ORIGINAL a times unit representative7 = 77

Euler unit representative7 raw image exact quotient := div(77, 12)

Euler unit representative7 raw image exact quotient = 77/12

Euler unit representative7 raw image floor quotient multiple := mul(6, 12)

Euler unit representative7 raw image floor quotient multiple = 72

Euler unit representative7 raw image normalized remainder := sub(77, 72)

Euler unit representative7 raw image normalized remainder = 5

Euler unit representative7 raw image:ORIGINAL signed integer=77;modulus=12;exact ratio=77/12;floor quotient=6

value=q*n+remainder;normalized residue=5 in[0,12);same congruence class,NOT absolute-value replacement

Euler ORIGINAL a times unit representative11 := mul(11, 11)

Euler ORIGINAL a times unit representative11 = 121

Euler unit representative11 raw image exact quotient := div(121, 12)

Euler unit representative11 raw image exact quotient = 121/12

Euler unit representative11 raw image floor quotient multiple := mul(10, 12)

Euler unit representative11 raw image floor quotient multiple = 120

Euler unit representative11 raw image normalized remainder := sub(121, 120)

Euler unit representative11 raw image normalized remainder = 1

Euler unit representative11 raw image:ORIGINAL signed integer=121;modulus=12;exact ratio=121/12;floor quotient=10

value=q*n+remainder;normalized residue=1 in[0,12);same congruence class,NOT absolute-value replacement

COMPLETE original increasing U(n)=[1, 5, 7, 11];actual images in ORIGINAL unit order=[11, 7, 5, 1]

SOURCE output sorts the mapped list numerically=[1, 5, 7, 11];full-list equality=是;not a claim each point is fixed

逐步反向核對

• S047 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S046 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S045 · premise_and_result_audit — 以精確有理數重算 Euler unit representative11 raw image normalized remainder，不以小數近似替代。
• S044 · premise_and_result_audit — 以精確有理數重算 Euler unit representative11 raw image floor quotient multiple，不以小數近似替代。
• S043 · premise_and_result_audit — 以精確有理數重算 Euler unit representative11 raw image exact quotient，不以小數近似替代。
• S042 · premise_and_result_audit — 以精確有理數重算 Euler ORIGINAL a times unit representative11，不以小數近似替代。
• S041 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S040 · premise_and_result_audit — 以精確有理數重算 Euler unit representative7 raw image normalized remainder，不以小數近似替代。
• S039 · premise_and_result_audit — 以精確有理數重算 Euler unit representative7 raw image floor quotient multiple，不以小數近似替代。
• S038 · premise_and_result_audit — 以精確有理數重算 Euler unit representative7 raw image exact quotient，不以小數近似替代。
• S037 · premise_and_result_audit — 以精確有理數重算 Euler ORIGINAL a times unit representative7，不以小數近似替代。
• S036 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S035 · premise_and_result_audit — 以精確有理數重算 Euler unit representative5 raw image normalized remainder，不以小數近似替代。
• S034 · premise_and_result_audit — 以精確有理數重算 Euler unit representative5 raw image floor quotient multiple，不以小數近似替代。
• S033 · premise_and_result_audit — 以精確有理數重算 Euler unit representative5 raw image exact quotient，不以小數近似替代。
• S032 · premise_and_result_audit — 以精確有理數重算 Euler ORIGINAL a times unit representative5，不以小數近似替代。
• S031 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S030 · premise_and_result_audit — 以精確有理數重算 Euler unit representative1 raw image normalized remainder，不以小數近似替代。
• S029 · premise_and_result_audit — 以精確有理數重算 Euler unit representative1 raw image floor quotient multiple，不以小數近似替代。
• S028 · premise_and_result_audit — 以精確有理數重算 Euler unit representative1 raw image exact quotient，不以小數近似替代。
• S027 · premise_and_result_audit — 以精確有理數重算 Euler ORIGINAL a times unit representative1，不以小數近似替代。
• S026 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S025 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S024 · premise_and_result_audit — 以精確有理數重算 Euler ACTUAL inverse check normalized remainder，不以小數近似替代。
• S023 · premise_and_result_audit — 以精確有理數重算 Euler ACTUAL inverse check floor quotient multiple，不以小數近似替代。
• S022 · premise_and_result_audit — 以精確有理數重算 Euler ACTUAL inverse check exact quotient，不以小數近似替代。
• S021 · premise_and_result_audit — 以精確有理數重算 Euler ACTUAL base-unit inverse product，不以小數近似替代。
• S020 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S019 · premise_and_result_audit — 以精確有理數重算 Euler complete reduced residue count phi，不以小數近似替代。
• S018 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S017 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S016 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S015 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S014 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S013 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S012 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S011 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S010 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S009 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S008 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S007 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S006 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S005 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。
• S004 · premise_and_result_audit — 以精確有理數重算 Euler ORIGINAL signed base normalization normalized remainder，不以小數近似替代。
• S003 · premise_and_result_audit — 以精確有理數重算 Euler ORIGINAL signed base normalization floor quotient multiple，不以小數近似替代。
• S002 · premise_and_result_audit — 以精確有理數重算 Euler ORIGINAL signed base normalization exact quotient，不以小數近似替代。
• S001 · premise_and_result_audit — 回到原始資料與本步條件核對，不把單向推論誤稱等價。

結論

([1, 5, 7, 11], [1, 5, 7, 11], 是, multiplication_by_a_permutes_reduced_residues)

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

本題覆核與來源綁定

覆核日期：2026-10-26

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