OCMEBilingual mathematics & derivations繁體中文

Explore related knowledge and questions →

Question 33658: Frobenius Fixes Every Element of This Prime Field

On this page
  1. Original question and givens
  2. Definition and scope
  3. Step-by-step derivation
  4. Reverse checks
  5. Result
  6. This question review and source binding

Return to catalogue page 169

← Question derivation index · Original question batch

R0066-33658 · q-20261014-advance-20261031-r06-finite-field-0083

Original question and givens

Use the complete prime field Z_19, with prime p=19, residue labels 0 through p−1, and addition/multiplication modulo p. Nonzero inputs alone may be inverted; division by zero is never allowed. This prime-field family does not assert that every finite field has prime order or that every finite ring is a field. element=7, possibly zero. Give (element,p,power,equal?,Frobenius_on_prime_field), with power=element^p modulo p.

  • G001 — Use the complete prime field Z_19, with prime p=19, residue labels 0 through p−1, and addition/multiplication modulo p. Nonzero inputs alone may be inverted; division by zero is never allowed. This prime-field family does not assert that every finite field has prime order or that every finite ring is a field. element=7, possibly zero. Give (element,p,power,equal?,Frobenius_on_prime_field), with power=element^p modulo p.

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.

Step-by-step derivation

S001 · implies

Before

source roles = [qf-mod31-fielddeep-frobenius, [domain, element, operation, p]]

After

derived = [fielddeep-frobenius, Exact_prime_field_Zp]

Conditions: none

THIS source uses LOCAL-hyphen operations with exact keys/domain.Keep source field order and numeric/Boolean/string roles;integer rational texts omit/1.Original questions,English,MKOs,ASTs and statuses remain unchanged.

Step identifiers and dependencies

Rule: R66_EXACT_source_bank_keys_local_operation_domain · Uses: G001

S002 · implies

Before

source roles = [19, [2, 3, 4]]

After

derived = [[1, 1, 3], Yes]

Conditions: none

Trial EVERY divisor2 through floor(sqrt(p));a composite would have a factor there.The empty test for p=2 is valid.This qualifies THIS prime field Z_p,not every finite field’s order or every finite ring as a field.

Step identifiers and dependencies

Rule: Field_PRIME_complete_trial_divisor_qualification · Uses: G001, S001

S003 · calculation

Before

Field ORIGINAL previous power times element k=1 := mul(1, 7)

After

Field ORIGINAL previous power times element k=1 = 7

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S002

S004 · implies

Before

source roles = [power exponent1, 7, 19]

After

derived = [0, 7]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S003

S005 · calculation

Before

Field ORIGINAL previous power times element k=2 := mul(7, 7)

After

Field ORIGINAL previous power times element k=2 = 49

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S004

S006 · implies

Before

source roles = [power exponent2, 49, 19]

After

derived = [2, 11]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S005

S007 · calculation

Before

Field ORIGINAL previous power times element k=3 := mul(11, 7)

After

Field ORIGINAL previous power times element k=3 = 77

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S006

S008 · implies

Before

source roles = [power exponent3, 77, 19]

After

derived = [4, 1]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S007

S009 · calculation

Before

Field ORIGINAL previous power times element k=4 := mul(1, 7)

After

Field ORIGINAL previous power times element k=4 = 7

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S008

S010 · implies

Before

source roles = [power exponent4, 7, 19]

After

derived = [0, 7]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S009

S011 · calculation

Before

Field ORIGINAL previous power times element k=5 := mul(7, 7)

After

Field ORIGINAL previous power times element k=5 = 49

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S010

S012 · implies

Before

source roles = [power exponent5, 49, 19]

After

derived = [2, 11]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S011

S013 · calculation

Before

Field ORIGINAL previous power times element k=6 := mul(11, 7)

After

Field ORIGINAL previous power times element k=6 = 77

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S012

S014 · implies

Before

source roles = [power exponent6, 77, 19]

After

derived = [4, 1]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S013

S015 · calculation

Before

Field ORIGINAL previous power times element k=7 := mul(1, 7)

After

Field ORIGINAL previous power times element k=7 = 7

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S014

S016 · implies

Before

source roles = [power exponent7, 7, 19]

After

derived = [0, 7]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S015

S017 · calculation

Before

Field ORIGINAL previous power times element k=8 := mul(7, 7)

After

Field ORIGINAL previous power times element k=8 = 49

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S016

S018 · implies

Before

source roles = [power exponent8, 49, 19]

After

derived = [2, 11]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S017

S019 · calculation

Before

Field ORIGINAL previous power times element k=9 := mul(11, 7)

After

Field ORIGINAL previous power times element k=9 = 77

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S018

S020 · implies

Before

source roles = [power exponent9, 77, 19]

After

derived = [4, 1]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S019

S021 · calculation

Before

Field ORIGINAL previous power times element k=10 := mul(1, 7)

After

Field ORIGINAL previous power times element k=10 = 7

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S020

S022 · implies

Before

source roles = [power exponent10, 7, 19]

After

derived = [0, 7]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S021

S023 · calculation

Before

Field ORIGINAL previous power times element k=11 := mul(7, 7)

After

Field ORIGINAL previous power times element k=11 = 49

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S022

S024 · implies

Before

source roles = [power exponent11, 49, 19]

After

derived = [2, 11]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S023

S025 · calculation

Before

Field ORIGINAL previous power times element k=12 := mul(11, 7)

After

Field ORIGINAL previous power times element k=12 = 77

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S024

S026 · implies

Before

source roles = [power exponent12, 77, 19]

After

derived = [4, 1]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S025

S027 · calculation

Before

Field ORIGINAL previous power times element k=13 := mul(1, 7)

After

Field ORIGINAL previous power times element k=13 = 7

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S026

S028 · implies

Before

source roles = [power exponent13, 7, 19]

After

derived = [0, 7]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S027

S029 · calculation

Before

Field ORIGINAL previous power times element k=14 := mul(7, 7)

After

Field ORIGINAL previous power times element k=14 = 49

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S028

S030 · implies

Before

source roles = [power exponent14, 49, 19]

After

derived = [2, 11]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S029

S031 · calculation

Before

Field ORIGINAL previous power times element k=15 := mul(11, 7)

After

Field ORIGINAL previous power times element k=15 = 77

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S030

S032 · implies

Before

source roles = [power exponent15, 77, 19]

After

derived = [4, 1]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S031

S033 · calculation

Before

Field ORIGINAL previous power times element k=16 := mul(1, 7)

After

Field ORIGINAL previous power times element k=16 = 7

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S032

S034 · implies

Before

source roles = [power exponent16, 7, 19]

After

derived = [0, 7]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S033

S035 · calculation

Before

Field ORIGINAL previous power times element k=17 := mul(7, 7)

After

Field ORIGINAL previous power times element k=17 = 49

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S034

S036 · implies

Before

source roles = [power exponent17, 49, 19]

After

derived = [2, 11]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S035

S037 · calculation

Before

Field ORIGINAL previous power times element k=18 := mul(11, 7)

After

Field ORIGINAL previous power times element k=18 = 77

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S036

S038 · implies

Before

source roles = [power exponent18, 77, 19]

After

derived = [4, 1]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S037

S039 · calculation

Before

Field ORIGINAL previous power times element k=19 := mul(1, 7)

After

Field ORIGINAL previous power times element k=19 = 7

Conditions: none

Calculate exactly from THIS step’s ORIGINAL ordered operands.Retain the SOURCE rational pre-reduction envelope separately;do not use floating values or silently widen a different bank.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S038

S040 · implies

Before

source roles = [power exponent19, 7, 19]

After

derived = [0, 7]

Conditions: none

Use integer Euclidean division: value=n*quotient+remainder with0≤remainder<n.Normalize negative representatives too;do not use floating remainders.

Step identifiers and dependencies

Rule: Finite_MOD_euclidean_quotient_remainder · Uses: G001, S039

S041 · implies

Before

source roles = [19, 7, [7, 11, 1, 7, 11, 1, 7, 11, 1, 7, 11, 1, 7, 11, 1, 7, 11, 1, 7]]

After

derived = [7, Yes]

Conditions: none

Repeated multiplication checks element^p=element in THIS prime field,including zero.Frobenius need not fix every element of an arbitrary extension field;do not widen the conclusion.

Step identifiers and dependencies

Rule: Field_FROBENIUS_prime_field_INCLUDES_zero · Uses: G001, S040

Reverse checks

  • S041 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S040 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S039 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=19 with exact rational arithmetic, not rounded decimals.
  • S038 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S037 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=18 with exact rational arithmetic, not rounded decimals.
  • S036 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S035 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=17 with exact rational arithmetic, not rounded decimals.
  • S034 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S033 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=16 with exact rational arithmetic, not rounded decimals.
  • S032 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S031 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=15 with exact rational arithmetic, not rounded decimals.
  • S030 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S029 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=14 with exact rational arithmetic, not rounded decimals.
  • S028 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S027 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=13 with exact rational arithmetic, not rounded decimals.
  • S026 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S025 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=12 with exact rational arithmetic, not rounded decimals.
  • S024 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S023 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=11 with exact rational arithmetic, not rounded decimals.
  • S022 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S021 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=10 with exact rational arithmetic, not rounded decimals.
  • S020 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S019 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=9 with exact rational arithmetic, not rounded decimals.
  • S018 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S017 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=8 with exact rational arithmetic, not rounded decimals.
  • S016 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S015 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=7 with exact rational arithmetic, not rounded decimals.
  • S014 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S013 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=6 with exact rational arithmetic, not rounded decimals.
  • S012 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S011 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=5 with exact rational arithmetic, not rounded decimals.
  • S010 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S009 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=4 with exact rational arithmetic, not rounded decimals.
  • S008 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S007 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=3 with exact rational arithmetic, not rounded decimals.
  • S006 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S005 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=2 with exact rational arithmetic, not rounded decimals.
  • S004 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S003 · premise_and_result_audit — Recompute Field ORIGINAL previous power times element k=1 with exact rational arithmetic, not rounded decimals.
  • S002 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.
  • S001 · premise_and_result_audit — Reverse-audit THIS step against its ORIGINAL ordered roles and complete premises.Accept the conclusion only under these conditions;do not invert a one-way implication or call a finite check a general formal proof.

Result

(7, 19, 7, Yes, Frobenius_on_prime_field)

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: 68918a83e63927bb24c62efb495692ce126f0e0bf7399cb8ef81ef903542643b
  • candidate record SHA-256: ac10c43d3fadd2645cc5291ec25bcdb0893104eb8119e6a13cbe165243d75fde
  • semantic review receipt SHA-256: 99b4f114b2ec93164b6aa5681e0107033a240e7a3f0a8988633ba65320ede267
  • question-first witness SHA-256: d9bd3a1940da8a73f790ee3fe460c9a8523791bdbe72c8e0304e3740b66710cc
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON