Question 19804: The All-Integer Prime Form Includes Bases Divisible by p

On this page

Original question and givens
Definition and scope
Step-by-step derivation
Reverse checks
Result
This question review and source binding

← Question derivation index · Original question batch

R0038-19804 · q-20261014-advance-20261106-r05-fermat-little-theorem-0029

Original question and givens

Use integer base a=-28 and modulus=7, 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 (p, normalized_base, power_p, comparison_residue, congruent, boundary).

G001 — Use integer base a=-28 and modulus=7, 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 (p, normalized_base, power_p, comparison_residue, congruent, 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

Step-by-step derivation

S001 · implies

Before

source operation=flt-all-integer;original snapshot and mathematics retained

After

explicit ordered source output fields=[p, normalized_base, power_p, comparison_residue, congruent, 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 dependencies

Rule: source_ordered_interface_explicit_without_javascript · Uses: G001

S002 · implies

Before

ACTUAL integer modulus=7;complete trial range2..floor_sqrt=2

After

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

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 dependencies

Rule: flt_primality_complete_trial_or_actual_factor_not_Fermat_test · Uses: G001, S001

S003 · implies

Before

original signed base=-28;positive modulus=7;use nonnegative gcd inputs=[28, 7]

After

ALL Euclidean rows[left,right,q,r]=[[28, 7, 4, 0]];terminal nonnegative gcd=7;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 dependencies

Rule: flt_actual_gcd_coprime_separate_from_primality · Uses: G001, S002

S004 · calculation

Before

Fermat original signed base exact quotient := div(-28, 7)

After

Fermat original signed base exact quotient = -4

Conditions: none

Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S003

S005 · calculation

Before

Fermat original signed base floor quotient multiple := mul(-4, 7)

After

Fermat original signed base floor quotient multiple = -28

Conditions: none

Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S004

S006 · calculation

Before

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

After

Fermat original signed base normalized remainder = 0

Conditions: none

Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S005

S007 · implies

Before

Fermat original signed base:signed integer value=-28;positive modulus=7;exact quotient=-4;floor q=-4

After

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

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 dependencies

Rule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S006

S008 · implies

Before

Fermat original modular exponent:original normalized base=0;original exponent=7;modulus=7

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 dependencies

Rule: flt_modular_power_initial_invariant · Uses: G001, S007

S009 · calculation

Before

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

After

Fermat original modular exponent bit0 accumulator product = 0

Conditions: none

Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S008

S010 · calculation

Before

Fermat original modular exponent bit0 accumulator reduction exact quotient := div(0, 7)

After

Fermat original modular exponent bit0 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S009

S011 · calculation

Before

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

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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S010

S012 · calculation

Before

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

After

Fermat original modular exponent bit0 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S011

S013 · implies

Before

Fermat original modular exponent bit0 accumulator reduction:signed integer value=0;positive modulus=7;exact quotient=0;floor q=0

After

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

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 dependencies

Rule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S012

S014 · calculation

Before

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

After

Fermat original modular exponent bit0 current base square = 0

Conditions: none

Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S013

S015 · calculation

Before

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

After

Fermat original modular exponent bit0 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S014

S016 · calculation

Before

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

After

Fermat original modular exponent bit0 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S015

S017 · calculation

Before

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

After

Fermat original modular exponent bit0 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S016

S018 · implies

Before

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

After

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

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 dependencies

Rule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S017

S019 · implies

Before

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

After

next[accumulator,base,exponent]=[0, 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 dependencies

Rule: flt_each_binary_power_step_exact_invariant · Uses: G001, S018

S020 · calculation

Before

Fermat original modular exponent bit1 accumulator product := mul(0, 0)

After

Fermat original modular exponent bit1 accumulator product = 0

Conditions: none

Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S019

S021 · calculation

Before

Fermat original modular exponent bit1 accumulator reduction exact quotient := div(0, 7)

After

Fermat original modular exponent bit1 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S020

S022 · calculation

Before

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

After

Fermat original modular exponent bit1 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S021

S023 · calculation

Before

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

After

Fermat original modular exponent bit1 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S022

S024 · implies

Before

Fermat original modular exponent bit1 accumulator reduction:signed integer value=0;positive modulus=7;exact quotient=0;floor q=0

After

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

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 dependencies

Rule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S023

S025 · calculation

Before

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

After

Fermat original modular exponent bit1 current base square = 0

Conditions: none

Substitute original roles and established intermediates exactly,retaining signs,denominators,indices and the relevant carrier.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S024

S026 · calculation

Before

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

After

Fermat original modular exponent bit1 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S025

S027 · calculation

Before

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

After

Fermat original modular exponent bit1 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S026

S028 · calculation

Before

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

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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S027

S029 · implies

Before

Fermat original modular exponent bit1 squared base reduction:signed integer value=0;positive modulus=7;exact quotient=0;floor q=0

After

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

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 dependencies

Rule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S028

S030 · implies

Before

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

After

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

Conditions: none

Step identifiers and dependencies

Rule: flt_each_binary_power_step_exact_invariant · Uses: G001, S029

S031 · calculation

Before

Fermat original modular exponent bit2 accumulator product := mul(0, 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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S030

S032 · calculation

Before

Fermat original modular exponent bit2 accumulator reduction exact quotient := div(0, 7)

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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S031

S033 · calculation

Before

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

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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S032

S034 · calculation

Before

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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S033

S035 · implies

Before

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

After

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

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 dependencies

Rule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S034

S036 · calculation

Before

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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S035

S037 · calculation

Before

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

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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S036

S038 · calculation

Before

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

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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S037

S039 · calculation

Before

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 dependencies

Rule: exact_rational_arithmetic · Uses: G001, S038

S040 · implies

Before

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

After

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

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 dependencies

Rule: flt_exact_signed_modulo_not_integer_equality · Uses: G001, S039

S041 · implies

Before

Fermat original modular exponent:step=2;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

Step identifiers and dependencies

Rule: flt_each_binary_power_step_exact_invariant · Uses: G001, S040

S042 · implies

Before

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

After

EXACT original base^7 modulo7=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 dependencies

Rule: flt_modular_power_terminal_not_primality_converse · Uses: G001, S041

S043 · implies

Before

ACTUAL prime p=7;original a=-28 is divisible by p;normalized residue0;positive exponent p

After

a^p residue=0=0=a residue;NO cancellation of a or0 needed

Conditions: none

When p divides a,it also divides the positive p-th power,so both residues are0.This branch does not cancel0 to derive the coprime form.

Step identifiers and dependencies

Rule: flt_all_integer_zero_residue_case_no_invalid_cancellation · Uses: G001, S042

Reverse checks

S043 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
S042 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
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

(7, 0, 0, 0, Yes, all_integer_form_including_prime_divides_a)

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: 96a18ddd6015c6fcd6f87999023a5907a01ef55d36d6351f4bb4f850840beaac
candidate record SHA-256: 6a8560abfcf1c42aeb80ac0eb167420e123a865b728f84cab395669f4925e343
semantic review receipt SHA-256: d165cad30849a3aba67390a59c572c0d965269d4b405e43df36da19e28d85612
question-first witness SHA-256: c222ca47a07939c019865a1e4d9ce633205cdee68db92bf96a96f5683a62ebc7
Lean: NOT_RUN · human review: NOT_PERFORMED

Same-source full JSON