# Question 19863: An Inapplicable Theorem Need Not Mean a Failed Modular Test [Return to catalogue page 100](https://ocme.evemisslab.com/en/questions/page/100/) [← Question derivation index](https://ocme.evemisslab.com/en/questions/) · [Original question batch](https://ocme.evemisslab.com/en/practice/batch-20261014-advance-20261106-r05-fermat-little-theorem-foundations/#q-20261014-advance-20261106-r05-fermat-little-theorem-0063) This teaching derivation has second-context AI mathematical and bilingual semantic review, limited to the model and assumptions stated in this question. It has no human review or new Lean proof and does not promote the original question or MKO to Canonical truth. R0038-19863 · q-20261014-advance-20261106-r05-fermat-little-theorem-0063 ## Original question and givens Use integer base a=14 and modulus=16, normalized residues in [0,modulus). Exact integer square-and-multiply computes powers; trial division checks primality. Every equality of residues here is a congruence modulo the stated modulus, not an unrestricted integer equality. The coprime form requires prime modulus and an invertible base; the all-integer form for prime p also allows p to divide a. Never cancel a noninvertible residue. Give (modulus, original_base, prime, coprime, coprime_form_applicable, power_modulus_minus_1, boundary). - G001 — Use integer base a=14 and modulus=16, normalized residues in [0,modulus). Exact integer square-and-multiply computes powers; trial division checks primality. Every equality of residues here is a congruence modulo the stated modulus, not an unrestricted integer equality. The coprime form requires prime modulus and an invertible base; the all-integer form for prime p also allows p to divide a. Never cancel a noninvertible residue. Give (modulus, original_base, prime, coprime, coprime_form_applicable, power_modulus_minus_1, boundary). ## Definition and scope Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate. - [mko-fermat-little-theorem](https://ocme.evemisslab.com/en/mko/mko-fermat-little-theorem/) ## Step-by-step derivation S001 · impliesBefore source operation=flt-hypothesis-audit;original snapshot and mathematics retained After explicit ordered source output fields=[modulus, original_base, prime, coprime, coprime_form_applicable, power_modulus_minus_1, boundary] Conditions: none Keep the historical interface marker in the original snapshot while listing ordered source fields here,without JavaScript or external lookup.Field labels are not mathematical evidence,and No retains the operation's claim scope. Step identifiers and dependenciesRule: source_ordered_interface_explicit_without_javascript · Uses: G001 S002 · impliesBefore ACTUAL integer modulus=16;complete trial range2..floor_sqrt=4 After checked rows[divisor,quotient,remainder]=[[2, 8, 0]];first exact factor=2;prime=No Conditions: none An exact factor in the trial range witnesses compositeness.If the entire range has no factor,any composite decomposition would require one at most sqrt(n),so all composite cases are excluded.The empty range for2 is valid.This is not a primality inference from a Fermat test. Step identifiers and dependenciesRule: flt_primality_complete_trial_or_actual_factor_not_Fermat_test · Uses: G001, S001 S003 · impliesBefore original signed base=14;positive modulus=16;use nonnegative gcd inputs=[14, 16] After ALL Euclidean rows[left,right,q,r]=[[14, 16, 0, 14], [16, 14, 1, 2], [14, 2, 7, 0]];terminal nonnegative gcd=2;coprime=No Conditions: none Euclidean replacements preserve common divisors and give the terminal gcd,including gcd(0,m)=m.Primality of the modulus and invertibility of the base remain separate flags. Step identifiers and dependenciesRule: flt_actual_gcd_coprime_separate_from_primality · Uses: G001, S002 S004 · calculationBefore Fermat original signed base exact quotient := div(14, 16) After Fermat original signed base exact quotient = 7/8 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S003 S005 · calculationBefore Fermat original signed base floor quotient multiple := mul(0, 16) After Fermat original signed base floor quotient multiple = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S004 S006 · calculationBefore Fermat original signed base normalized remainder := sub(14, 0) After Fermat original signed base normalized remainder = 14 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S005 S007 · impliesBefore Fermat original signed base:signed integer value=14;positive modulus=16;exact quotient=7/8;floor q=0 After value=q*modulus+remainder;normalized remainder=14 in[0,16) Conditions: none Use a positive modulus and floor quotient to obtain the nonnegative representative even for a negative base.Equal remainders express congruence modulo this modulus,not unrestricted integer equality. Step identifiers and dependenciesRule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S006 S008 · impliesBefore Fermat original modular exponent:original normalized base=14;original exponent=15;modulus=16 After initialize accumulator1,current_base=base,remaining=exponent;invariant accumulator*current_base^remaining congruent to original power Conditions: none The multiplicative identity gives the exponent0 convention.Each step preserves congruence to the same original power without constructing huge ordinary powers or replacing modular relations with real equalities. Step identifiers and dependenciesRule: flt_modular_power_initial_invariant · Uses: G001, S007 S009 · calculationBefore Fermat original modular exponent bit0 accumulator product := mul(1, 14) After Fermat original modular exponent bit0 accumulator product = 14 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S008 S010 · calculationBefore Fermat original modular exponent bit0 accumulator reduction exact quotient := div(14, 16) After Fermat original modular exponent bit0 accumulator reduction exact quotient = 7/8 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S009 S011 · calculationBefore Fermat original modular exponent bit0 accumulator reduction floor quotient multiple := mul(0, 16) After Fermat original modular exponent bit0 accumulator reduction floor quotient multiple = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S010 S012 · calculationBefore Fermat original modular exponent bit0 accumulator reduction normalized remainder := sub(14, 0) After Fermat original modular exponent bit0 accumulator reduction normalized remainder = 14 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S011 S013 · impliesBefore Fermat original modular exponent bit0 accumulator reduction:signed integer value=14;positive modulus=16;exact quotient=7/8;floor q=0 After value=q*modulus+remainder;normalized remainder=14 in[0,16) Conditions: none Use a positive modulus and floor quotient to obtain the nonnegative representative even for a negative base.Equal remainders express congruence modulo this modulus,not unrestricted integer equality. Step identifiers and dependenciesRule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S012 S014 · calculationBefore Fermat original modular exponent bit0 current base square := mul(14, 14) After Fermat original modular exponent bit0 current base square = 196 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S013 S015 · calculationBefore Fermat original modular exponent bit0 squared base reduction exact quotient := div(196, 16) After Fermat original modular exponent bit0 squared base reduction exact quotient = 49/4 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S014 S016 · calculationBefore Fermat original modular exponent bit0 squared base reduction floor quotient multiple := mul(12, 16) After Fermat original modular exponent bit0 squared base reduction floor quotient multiple = 192 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S015 S017 · calculationBefore Fermat original modular exponent bit0 squared base reduction normalized remainder := sub(196, 192) After Fermat original modular exponent bit0 squared base reduction normalized remainder = 4 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S016 S018 · impliesBefore Fermat original modular exponent bit0 squared base reduction:signed integer value=196;positive modulus=16;exact quotient=49/4;floor q=12 After value=q*modulus+remainder;normalized remainder=4 in[0,16) Conditions: none Use a positive modulus and floor quotient to obtain the nonnegative representative even for a negative base.Equal remainders express congruence modulo this modulus,not unrestricted integer equality. Step identifiers and dependenciesRule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S017 S019 · impliesBefore Fermat original modular exponent:step=0;previous[accumulator,base,exponent]=[1, 14, 15];low bit=1 After next[accumulator,base,exponent]=[14, 4, 7];split exponent=2*q+bit preserves original-power invariant Conditions: none Replace an even power by a squared base;an odd power also contributes one base factor to the accumulator.Exact reductions preserve congruence and halving the remaining nonnegative exponent guarantees termination. Step identifiers and dependenciesRule: flt_each_binary_power_step_exact_invariant · Uses: G001, S018 S020 · calculationBefore Fermat original modular exponent bit1 accumulator product := mul(14, 4) After Fermat original modular exponent bit1 accumulator product = 56 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S019 S021 · calculationBefore Fermat original modular exponent bit1 accumulator reduction exact quotient := div(56, 16) After Fermat original modular exponent bit1 accumulator reduction exact quotient = 7/2 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S020 S022 · calculationBefore Fermat original modular exponent bit1 accumulator reduction floor quotient multiple := mul(3, 16) After Fermat original modular exponent bit1 accumulator reduction floor quotient multiple = 48 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S021 S023 · calculationBefore Fermat original modular exponent bit1 accumulator reduction normalized remainder := sub(56, 48) After Fermat original modular exponent bit1 accumulator reduction normalized remainder = 8 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S022 S024 · impliesBefore Fermat original modular exponent bit1 accumulator reduction:signed integer value=56;positive modulus=16;exact quotient=7/2;floor q=3 After value=q*modulus+remainder;normalized remainder=8 in[0,16) Conditions: none Use a positive modulus and floor quotient to obtain the nonnegative representative even for a negative base.Equal remainders express congruence modulo this modulus,not unrestricted integer equality. Step identifiers and dependenciesRule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S023 S025 · calculationBefore Fermat original modular exponent bit1 current base square := mul(4, 4) After Fermat original modular exponent bit1 current base square = 16 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S024 S026 · calculationBefore Fermat original modular exponent bit1 squared base reduction exact quotient := div(16, 16) After Fermat original modular exponent bit1 squared base reduction exact quotient = 1 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S025 S027 · calculationBefore Fermat original modular exponent bit1 squared base reduction floor quotient multiple := mul(1, 16) After Fermat original modular exponent bit1 squared base reduction floor quotient multiple = 16 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S026 S028 · calculationBefore Fermat original modular exponent bit1 squared base reduction normalized remainder := sub(16, 16) After Fermat original modular exponent bit1 squared base reduction normalized remainder = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S027 S029 · impliesBefore Fermat original modular exponent bit1 squared base reduction:signed integer value=16;positive modulus=16;exact quotient=1;floor q=1 After value=q*modulus+remainder;normalized remainder=0 in[0,16) Conditions: none Use a positive modulus and floor quotient to obtain the nonnegative representative even for a negative base.Equal remainders express congruence modulo this modulus,not unrestricted integer equality. Step identifiers and dependenciesRule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S028 S030 · impliesBefore Fermat original modular exponent:step=1;previous[accumulator,base,exponent]=[14, 4, 7];low bit=1 After next[accumulator,base,exponent]=[8, 0, 3];split exponent=2*q+bit preserves original-power invariant Conditions: none Replace an even power by a squared base;an odd power also contributes one base factor to the accumulator.Exact reductions preserve congruence and halving the remaining nonnegative exponent guarantees termination. Step identifiers and dependenciesRule: flt_each_binary_power_step_exact_invariant · Uses: G001, S029 S031 · calculationBefore Fermat original modular exponent bit2 accumulator product := mul(8, 0) After Fermat original modular exponent bit2 accumulator product = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S030 S032 · calculationBefore Fermat original modular exponent bit2 accumulator reduction exact quotient := div(0, 16) After Fermat original modular exponent bit2 accumulator reduction exact quotient = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S031 S033 · calculationBefore Fermat original modular exponent bit2 accumulator reduction floor quotient multiple := mul(0, 16) After Fermat original modular exponent bit2 accumulator reduction floor quotient multiple = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S032 S034 · calculationBefore Fermat original modular exponent bit2 accumulator reduction normalized remainder := sub(0, 0) After Fermat original modular exponent bit2 accumulator reduction normalized remainder = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S033 S035 · impliesBefore Fermat original modular exponent bit2 accumulator reduction:signed integer value=0;positive modulus=16;exact quotient=0;floor q=0 After value=q*modulus+remainder;normalized remainder=0 in[0,16) Conditions: none Use a positive modulus and floor quotient to obtain the nonnegative representative even for a negative base.Equal remainders express congruence modulo this modulus,not unrestricted integer equality. Step identifiers and dependenciesRule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S034 S036 · calculationBefore Fermat original modular exponent bit2 current base square := mul(0, 0) After Fermat original modular exponent bit2 current base square = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S035 S037 · calculationBefore Fermat original modular exponent bit2 squared base reduction exact quotient := div(0, 16) After Fermat original modular exponent bit2 squared base reduction exact quotient = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S036 S038 · calculationBefore Fermat original modular exponent bit2 squared base reduction floor quotient multiple := mul(0, 16) After Fermat original modular exponent bit2 squared base reduction floor quotient multiple = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S037 S039 · calculationBefore Fermat original modular exponent bit2 squared base reduction normalized remainder := sub(0, 0) After Fermat original modular exponent bit2 squared base reduction normalized remainder = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S038 S040 · impliesBefore Fermat original modular exponent bit2 squared base reduction:signed integer value=0;positive modulus=16;exact quotient=0;floor q=0 After value=q*modulus+remainder;normalized remainder=0 in[0,16) Conditions: none Use a positive modulus and floor quotient to obtain the nonnegative representative even for a negative base.Equal remainders express congruence modulo this modulus,not unrestricted integer equality. Step identifiers and dependenciesRule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S039 S041 · impliesBefore Fermat original modular exponent:step=2;previous[accumulator,base,exponent]=[8, 0, 3];low bit=1 After next[accumulator,base,exponent]=[0, 0, 1];split exponent=2*q+bit preserves original-power invariant Conditions: none Replace an even power by a squared base;an odd power also contributes one base factor to the accumulator.Exact reductions preserve congruence and halving the remaining nonnegative exponent guarantees termination. Step identifiers and dependenciesRule: flt_each_binary_power_step_exact_invariant · Uses: G001, S040 S042 · calculationBefore Fermat original modular exponent bit3 accumulator product := mul(0, 0) After Fermat original modular exponent bit3 accumulator product = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S041 S043 · calculationBefore Fermat original modular exponent bit3 accumulator reduction exact quotient := div(0, 16) After Fermat original modular exponent bit3 accumulator reduction exact quotient = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S042 S044 · calculationBefore Fermat original modular exponent bit3 accumulator reduction floor quotient multiple := mul(0, 16) After Fermat original modular exponent bit3 accumulator reduction floor quotient multiple = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S043 S045 · calculationBefore Fermat original modular exponent bit3 accumulator reduction normalized remainder := sub(0, 0) After Fermat original modular exponent bit3 accumulator reduction normalized remainder = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S044 S046 · impliesBefore Fermat original modular exponent bit3 accumulator reduction:signed integer value=0;positive modulus=16;exact quotient=0;floor q=0 After value=q*modulus+remainder;normalized remainder=0 in[0,16) Conditions: none Use a positive modulus and floor quotient to obtain the nonnegative representative even for a negative base.Equal remainders express congruence modulo this modulus,not unrestricted integer equality. Step identifiers and dependenciesRule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S045 S047 · calculationBefore Fermat original modular exponent bit3 current base square := mul(0, 0) After Fermat original modular exponent bit3 current base square = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S046 S048 · calculationBefore Fermat original modular exponent bit3 squared base reduction exact quotient := div(0, 16) After Fermat original modular exponent bit3 squared base reduction exact quotient = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S047 S049 · calculationBefore Fermat original modular exponent bit3 squared base reduction floor quotient multiple := mul(0, 16) After Fermat original modular exponent bit3 squared base reduction floor quotient multiple = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S048 S050 · calculationBefore Fermat original modular exponent bit3 squared base reduction normalized remainder := sub(0, 0) After Fermat original modular exponent bit3 squared base reduction normalized remainder = 0 Conditions: none Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier. Step identifiers and dependenciesRule: exact_rational_arithmetic · Uses: G001, S049 S051 · impliesBefore Fermat original modular exponent bit3 squared base reduction:signed integer value=0;positive modulus=16;exact quotient=0;floor q=0 After value=q*modulus+remainder;normalized remainder=0 in[0,16) Conditions: none Use a positive modulus and floor quotient to obtain the nonnegative representative even for a negative base.Equal remainders express congruence modulo this modulus,not unrestricted integer equality. Step identifiers and dependenciesRule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S050 S052 · impliesBefore Fermat original modular exponent:step=3;previous[accumulator,base,exponent]=[0, 0, 1];low bit=1 After next[accumulator,base,exponent]=[0, 0, 0];split exponent=2*q+bit preserves original-power invariant Conditions: none Replace an even power by a squared base;an odd power also contributes one base factor to the accumulator.Exact reductions preserve congruence and halving the remaining nonnegative exponent guarantees termination. Step identifiers and dependenciesRule: flt_each_binary_power_step_exact_invariant · Uses: G001, S051 S053 · impliesBefore Fermat original modular exponent:remaining exponent0;final normalized accumulator=0 After EXACT original base^15 modulo16=0 Conditions: none At remaining exponent0 the invariant leaves exactly the accumulator,giving the original power's residue.The arithmetic result alone does not certify a prime modulus. Step identifiers and dependenciesRule: flt_modular_power_terminal_not_primality_converse · Uses: G001, S052 S054 · impliesBefore ACTUAL modulus=16;ORIGINAL signed base=14;prime=No;coprime=No;actual power residue=0 After prime-coprime applicability=No;failed hypotheses do NOT force actual residue!=1;one successful residue does NOT prove prime Conditions: none The joint flag conjoins the hypotheses rather than comparing the computed power with1.A composite may yield1 for a particular base.Inapplicability does not force arithmetic failure,and a passing power does not establish primality. Step identifiers and dependenciesRule: flt_applicability_not_actual_power_failure_or_converse · Uses: G001, S053 ## Reverse checks - S054 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S053 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S052 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S051 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S050 · premise_and_result_audit — Recompute Fermat original modular exponent bit3 squared base reduction normalized remainder with exact rational arithmetic, not rounded decimals. - S049 · premise_and_result_audit — Recompute Fermat original modular exponent bit3 squared base reduction floor quotient multiple with exact rational arithmetic, not rounded decimals. - S048 · premise_and_result_audit — Recompute Fermat original modular exponent bit3 squared base reduction exact quotient with exact rational arithmetic, not rounded decimals. - S047 · premise_and_result_audit — Recompute Fermat original modular exponent bit3 current base square with exact rational arithmetic, not rounded decimals. - S046 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S045 · premise_and_result_audit — Recompute Fermat original modular exponent bit3 accumulator reduction normalized remainder with exact rational arithmetic, not rounded decimals. - S044 · premise_and_result_audit — Recompute Fermat original modular exponent bit3 accumulator reduction floor quotient multiple with exact rational arithmetic, not rounded decimals. - S043 · premise_and_result_audit — Recompute Fermat original modular exponent bit3 accumulator reduction exact quotient with exact rational arithmetic, not rounded decimals. - S042 · premise_and_result_audit — Recompute Fermat original modular exponent bit3 accumulator product with exact rational arithmetic, not rounded decimals. - S041 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S040 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S039 · premise_and_result_audit — Recompute Fermat original modular exponent bit2 squared base reduction normalized remainder with exact rational arithmetic, not rounded decimals. - S038 · premise_and_result_audit — Recompute Fermat original modular exponent bit2 squared base reduction floor quotient multiple with exact rational arithmetic, not rounded decimals. - S037 · premise_and_result_audit — Recompute Fermat original modular exponent bit2 squared base reduction exact quotient with exact rational arithmetic, not rounded decimals. - S036 · premise_and_result_audit — Recompute Fermat original modular exponent bit2 current base square with exact rational arithmetic, not rounded decimals. - S035 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S034 · premise_and_result_audit — Recompute Fermat original modular exponent bit2 accumulator reduction normalized remainder with exact rational arithmetic, not rounded decimals. - S033 · premise_and_result_audit — Recompute Fermat original modular exponent bit2 accumulator reduction floor quotient multiple with exact rational arithmetic, not rounded decimals. - S032 · premise_and_result_audit — Recompute Fermat original modular exponent bit2 accumulator reduction exact quotient with exact rational arithmetic, not rounded decimals. - S031 · premise_and_result_audit — Recompute Fermat original modular exponent bit2 accumulator product with exact rational arithmetic, not rounded decimals. - S030 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S029 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S028 · premise_and_result_audit — Recompute Fermat original modular exponent bit1 squared base reduction normalized remainder with exact rational arithmetic, not rounded decimals. - S027 · premise_and_result_audit — Recompute Fermat original modular exponent bit1 squared base reduction floor quotient multiple with exact rational arithmetic, not rounded decimals. - S026 · premise_and_result_audit — Recompute Fermat original modular exponent bit1 squared base reduction exact quotient with exact rational arithmetic, not rounded decimals. - S025 · premise_and_result_audit — Recompute Fermat original modular exponent bit1 current base square with exact rational arithmetic, not rounded decimals. - S024 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S023 · premise_and_result_audit — Recompute Fermat original modular exponent bit1 accumulator reduction normalized remainder with exact rational arithmetic, not rounded decimals. - S022 · premise_and_result_audit — Recompute Fermat original modular exponent bit1 accumulator reduction floor quotient multiple with exact rational arithmetic, not rounded decimals. - S021 · premise_and_result_audit — Recompute Fermat original modular exponent bit1 accumulator reduction exact quotient with exact rational arithmetic, not rounded decimals. - S020 · premise_and_result_audit — Recompute Fermat original modular exponent bit1 accumulator product with exact rational arithmetic, not rounded decimals. - S019 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S018 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S017 · premise_and_result_audit — Recompute Fermat original modular exponent bit0 squared base reduction normalized remainder with exact rational arithmetic, not rounded decimals. - S016 · premise_and_result_audit — Recompute Fermat original modular exponent bit0 squared base reduction floor quotient multiple with exact rational arithmetic, not rounded decimals. - S015 · premise_and_result_audit — Recompute Fermat original modular exponent bit0 squared base reduction exact quotient with exact rational arithmetic, not rounded decimals. - S014 · premise_and_result_audit — Recompute Fermat original modular exponent bit0 current base square with exact rational arithmetic, not rounded decimals. - S013 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S012 · premise_and_result_audit — Recompute Fermat original modular exponent bit0 accumulator reduction normalized remainder with exact rational arithmetic, not rounded decimals. - S011 · premise_and_result_audit — Recompute Fermat original modular exponent bit0 accumulator reduction floor quotient multiple with exact rational arithmetic, not rounded decimals. - S010 · premise_and_result_audit — Recompute Fermat original modular exponent bit0 accumulator reduction exact quotient with exact rational arithmetic, not rounded decimals. - S009 · premise_and_result_audit — Recompute Fermat original modular exponent bit0 accumulator product with exact rational arithmetic, not rounded decimals. - S008 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S007 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S006 · premise_and_result_audit — Recompute Fermat original signed base normalized remainder with exact rational arithmetic, not rounded decimals. - S005 · premise_and_result_audit — Recompute Fermat original signed base floor quotient multiple with exact rational arithmetic, not rounded decimals. - S004 · premise_and_result_audit — Recompute Fermat original signed base exact quotient with exact rational arithmetic, not rounded decimals. - S003 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S002 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. - S001 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence. ## Result (16, 14, No, No, No, 0, coprime_form_not_applicable_without_both_hypotheses) The full substitutions and premise checks give the original answer; source identity,format and status are unchanged. ## This question review and source binding Review date: 2026-10-26 Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof. Source hashes and review receipts - input commit: 0f7be61e2c22317a4075561dc822c87d881a50db - original question SHA-256: e9ed0395a84cb3f4ef399e45e4542e9c487408798b81c78d9da78a5757597973 - candidate record SHA-256: a2220f44040324a0a8ca53d1b4638c706be9d11571ac217364112dc59236856b - semantic review receipt SHA-256: d165cad30849a3aba67390a59c572c0d965269d4b405e43df36da19e28d85612 - question-first witness SHA-256: c222ca47a07939c019865a1e4d9ce633205cdee68db92bf96a96f5683a62ebc7 - Lean: NOT_RUN · human review: NOT_PERFORMED [Same-source full JSON](https://ocme.evemisslab.com/data/question-derivations/questions/q-20261014-advance-20261106-r05-fermat-little-theorem-0063.json)