Explore related knowledge and questions →

Question 23493: Cauchy Requires a Prime Divisor of a Fully Certified Finite Group

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 118

← Question derivation index · Original question batch

R0045-23493 · q-20261014-advance-20261112-r01-cauchy-theorem-finite-groups-0018

Original question and givens

Use complete finite Cayley table=[[7, 8, 9, 0, 1, 2, 3, 4, 5, 6], [8, 9, 0, 1, 2, 3, 4, 5, 6, 7], [9, 0, 1, 2, 3, 4, 5, 6, 7, 8], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], [1, 2, 3, 4, 5, 6, 7, 8, 9, 0], [2, 3, 4, 5, 6, 7, 8, 9, 0, 1], [3, 4, 5, 6, 7, 8, 9, 0, 1, 2], [4, 5, 6, 7, 8, 9, 0, 1, 2, 3], [5, 6, 7, 8, 9, 0, 1, 2, 3, 4], [6, 7, 8, 9, 0, 1, 2, 3, 4, 5]] with identity=3, row g/column h meaning g*h. Certify closure, associativity, identity and inverses. Element order is the least positive exponent returning to this same identity, not just one exponent that does so. Declared prime=2. Give (group_order, prime, qualified, divisibility_remainder, certificate).

  • G001 — Use complete finite Cayley table=[[7, 8, 9, 0, 1, 2, 3, 4, 5, 6], [8, 9, 0, 1, 2, 3, 4, 5, 6, 7], [9, 0, 1, 2, 3, 4, 5, 6, 7, 8], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], [1, 2, 3, 4, 5, 6, 7, 8, 9, 0], [2, 3, 4, 5, 6, 7, 8, 9, 0, 1], [3, 4, 5, 6, 7, 8, 9, 0, 1, 2], [4, 5, 6, 7, 8, 9, 0, 1, 2, 3], [5, 6, 7, 8, 9, 0, 1, 2, 3, 4], [6, 7, 8, 9, 0, 1, 2, 3, 4, 5]] with identity=3, row g/column h meaning g*h. Certify closure, associativity, identity and inverses. Element order is the least positive exponent returning to this same identity, not just one exponent that does so. Declared prime=2. Give (group_order, prime, qualified, divisibility_remainder, certificate).

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 operation=cauchy-prime-divisor-qualification;original snapshot and mathematics retained

After

explicit ordered source output fields=[group_order, prime, qualified, divisibility_remainder, certificate]

Conditions: none

Retain the historical interface marker while listing source fields without JavaScript.Tags and No retain their claim scope;source-protocol ordering is not a mathematical proof.

Step identifiers and dependencies

Rule: source_ordered_interface_explicit_without_javascript · Uses: G001

S002 · implies

Before

ORIGINAL closed Cayley table=[[7, 8, 9, 0, 1, 2, 3, 4, 5, 6], [8, 9, 0, 1, 2, 3, 4, 5, 6, 7], [9, 0, 1, 2, 3, 4, 5, 6, 7, 8], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], [1, 2, 3, 4, 5, 6, 7, 8, 9, 0], [2, 3, 4, 5, 6, 7, 8, 9, 0, 1], [3, 4, 5, 6, 7, 8, 9, 0, 1, 2], [4, 5, 6, 7, 8, 9, 0, 1, 2, 3], [5, 6, 7, 8, 9, 0, 1, 2, 3, 4], [6, 7, 8, 9, 0, 1, 2, 3, 4, 5]];ACTUAL declared group identity=3

After

ALL [g,e*g,g*e,both_equal_g] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]];two-sided group identity=Yes

Conditions: none

Both e*g and g*e in the group table must equal g.This is not certified by an identity-action row on points.

Step identifiers and dependencies

Rule: groupaction_group_identity_both_sides_not_action_identity · Uses: G001, S001

S003 · implies

Before

ORIGINAL group pair(g,h)=[0, 0];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S002

S004 · implies

Before

ORIGINAL group pair(g,h)=[0, 1];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S003

S005 · implies

Before

ORIGINAL group pair(g,h)=[0, 2];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S004

S006 · implies

Before

ORIGINAL group pair(g,h)=[0, 3];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S005

S007 · implies

Before

ORIGINAL group pair(g,h)=[0, 4];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S006

S008 · implies

Before

ORIGINAL group pair(g,h)=[0, 5];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S007

S009 · implies

Before

ORIGINAL group pair(g,h)=[0, 6];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S008

S010 · implies

Before

ORIGINAL group pair(g,h)=[0, 7];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S009

S011 · implies

Before

ORIGINAL group pair(g,h)=[0, 8];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S010

S012 · implies

Before

ORIGINAL group pair(g,h)=[0, 9];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S011

S013 · implies

Before

ORIGINAL group pair(g,h)=[1, 0];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S012

S014 · implies

Before

ORIGINAL group pair(g,h)=[1, 1];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S013

S015 · implies

Before

ORIGINAL group pair(g,h)=[1, 2];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S014

S016 · implies

Before

ORIGINAL group pair(g,h)=[1, 3];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S015

S017 · implies

Before

ORIGINAL group pair(g,h)=[1, 4];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S016

S018 · implies

Before

ORIGINAL group pair(g,h)=[1, 5];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S017

S019 · implies

Before

ORIGINAL group pair(g,h)=[1, 6];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S018

S020 · implies

Before

ORIGINAL group pair(g,h)=[1, 7];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S019

S021 · implies

Before

ORIGINAL group pair(g,h)=[1, 8];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S020

S022 · implies

Before

ORIGINAL group pair(g,h)=[1, 9];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S021

S023 · implies

Before

ORIGINAL group pair(g,h)=[2, 0];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S022

S024 · implies

Before

ORIGINAL group pair(g,h)=[2, 1];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S023

S025 · implies

Before

ORIGINAL group pair(g,h)=[2, 2];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S024

S026 · implies

Before

ORIGINAL group pair(g,h)=[2, 3];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S025

S027 · implies

Before

ORIGINAL group pair(g,h)=[2, 4];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S026

S028 · implies

Before

ORIGINAL group pair(g,h)=[2, 5];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S027

S029 · implies

Before

ORIGINAL group pair(g,h)=[2, 6];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S028

S030 · implies

Before

ORIGINAL group pair(g,h)=[2, 7];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S029

S031 · implies

Before

ORIGINAL group pair(g,h)=[2, 8];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S030

S032 · implies

Before

ORIGINAL group pair(g,h)=[2, 9];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S031

S033 · implies

Before

ORIGINAL group pair(g,h)=[3, 0];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S032

S034 · implies

Before

ORIGINAL group pair(g,h)=[3, 1];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S033

S035 · implies

Before

ORIGINAL group pair(g,h)=[3, 2];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S034

S036 · implies

Before

ORIGINAL group pair(g,h)=[3, 3];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S035

S037 · implies

Before

ORIGINAL group pair(g,h)=[3, 4];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S036

S038 · implies

Before

ORIGINAL group pair(g,h)=[3, 5];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S037

S039 · implies

Before

ORIGINAL group pair(g,h)=[3, 6];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S038

S040 · implies

Before

ORIGINAL group pair(g,h)=[3, 7];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S039

S041 · implies

Before

ORIGINAL group pair(g,h)=[3, 8];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S040

S042 · implies

Before

ORIGINAL group pair(g,h)=[3, 9];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S041

S043 · implies

Before

ORIGINAL group pair(g,h)=[4, 0];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S042

S044 · implies

Before

ORIGINAL group pair(g,h)=[4, 1];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S043

S045 · implies

Before

ORIGINAL group pair(g,h)=[4, 2];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S044

S046 · implies

Before

ORIGINAL group pair(g,h)=[4, 3];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S045

S047 · implies

Before

ORIGINAL group pair(g,h)=[4, 4];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S046

S048 · implies

Before

ORIGINAL group pair(g,h)=[4, 5];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S047

S049 · implies

Before

ORIGINAL group pair(g,h)=[4, 6];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S048

S050 · implies

Before

ORIGINAL group pair(g,h)=[4, 7];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S049

S051 · implies

Before

ORIGINAL group pair(g,h)=[4, 8];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S050

S052 · implies

Before

ORIGINAL group pair(g,h)=[4, 9];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S051

S053 · implies

Before

ORIGINAL group pair(g,h)=[5, 0];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S052

S054 · implies

Before

ORIGINAL group pair(g,h)=[5, 1];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S053

S055 · implies

Before

ORIGINAL group pair(g,h)=[5, 2];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S054

S056 · implies

Before

ORIGINAL group pair(g,h)=[5, 3];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S055

S057 · implies

Before

ORIGINAL group pair(g,h)=[5, 4];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S056

S058 · implies

Before

ORIGINAL group pair(g,h)=[5, 5];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S057

S059 · implies

Before

ORIGINAL group pair(g,h)=[5, 6];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S058

S060 · implies

Before

ORIGINAL group pair(g,h)=[5, 7];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S059

S061 · implies

Before

ORIGINAL group pair(g,h)=[5, 8];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S060

S062 · implies

Before

ORIGINAL group pair(g,h)=[5, 9];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S061

S063 · implies

Before

ORIGINAL group pair(g,h)=[6, 0];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S062

S064 · implies

Before

ORIGINAL group pair(g,h)=[6, 1];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S063

S065 · implies

Before

ORIGINAL group pair(g,h)=[6, 2];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S064

S066 · implies

Before

ORIGINAL group pair(g,h)=[6, 3];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S065

S067 · implies

Before

ORIGINAL group pair(g,h)=[6, 4];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S066

S068 · implies

Before

ORIGINAL group pair(g,h)=[6, 5];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S067

S069 · implies

Before

ORIGINAL group pair(g,h)=[6, 6];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S068

S070 · implies

Before

ORIGINAL group pair(g,h)=[6, 7];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S069

S071 · implies

Before

ORIGINAL group pair(g,h)=[6, 8];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S070

S072 · implies

Before

ORIGINAL group pair(g,h)=[6, 9];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S071

S073 · implies

Before

ORIGINAL group pair(g,h)=[7, 0];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S072

S074 · implies

Before

ORIGINAL group pair(g,h)=[7, 1];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S073

S075 · implies

Before

ORIGINAL group pair(g,h)=[7, 2];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S074

S076 · implies

Before

ORIGINAL group pair(g,h)=[7, 3];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S075

S077 · implies

Before

ORIGINAL group pair(g,h)=[7, 4];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S076

S078 · implies

Before

ORIGINAL group pair(g,h)=[7, 5];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S077

S079 · implies

Before

ORIGINAL group pair(g,h)=[7, 6];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S078

S080 · implies

Before

ORIGINAL group pair(g,h)=[7, 7];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S079

S081 · implies

Before

ORIGINAL group pair(g,h)=[7, 8];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S080

S082 · implies

Before

ORIGINAL group pair(g,h)=[7, 9];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S081

S083 · implies

Before

ORIGINAL group pair(g,h)=[8, 0];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S082

S084 · implies

Before

ORIGINAL group pair(g,h)=[8, 1];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S083

S085 · implies

Before

ORIGINAL group pair(g,h)=[8, 2];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S084

S086 · implies

Before

ORIGINAL group pair(g,h)=[8, 3];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S085

S087 · implies

Before

ORIGINAL group pair(g,h)=[8, 4];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S086

S088 · implies

Before

ORIGINAL group pair(g,h)=[8, 5];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S087

S089 · implies

Before

ORIGINAL group pair(g,h)=[8, 6];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S088

S090 · implies

Before

ORIGINAL group pair(g,h)=[8, 7];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S089

S091 · implies

Before

ORIGINAL group pair(g,h)=[8, 8];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S090

S092 · implies

Before

ORIGINAL group pair(g,h)=[8, 9];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S091

S093 · implies

Before

ORIGINAL group pair(g,h)=[9, 0];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 3, 3, Yes], [1, 4, 4, Yes], [2, 5, 5, Yes], [3, 6, 6, Yes], [4, 7, 7, Yes], [5, 8, 8, Yes], [6, 9, 9, Yes], [7, 0, 0, Yes], [8, 1, 1, Yes], [9, 2, 2, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S092

S094 · implies

Before

ORIGINAL group pair(g,h)=[9, 1];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 4, 4, Yes], [1, 5, 5, Yes], [2, 6, 6, Yes], [3, 7, 7, Yes], [4, 8, 8, Yes], [5, 9, 9, Yes], [6, 0, 0, Yes], [7, 1, 1, Yes], [8, 2, 2, Yes], [9, 3, 3, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S093

S095 · implies

Before

ORIGINAL group pair(g,h)=[9, 2];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 5, 5, Yes], [1, 6, 6, Yes], [2, 7, 7, Yes], [3, 8, 8, Yes], [4, 9, 9, Yes], [5, 0, 0, Yes], [6, 1, 1, Yes], [7, 2, 2, Yes], [8, 3, 3, Yes], [9, 4, 4, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S094

S096 · implies

Before

ORIGINAL group pair(g,h)=[9, 3];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 6, 6, Yes], [1, 7, 7, Yes], [2, 8, 8, Yes], [3, 9, 9, Yes], [4, 0, 0, Yes], [5, 1, 1, Yes], [6, 2, 2, Yes], [7, 3, 3, Yes], [8, 4, 4, Yes], [9, 5, 5, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S095

S097 · implies

Before

ORIGINAL group pair(g,h)=[9, 4];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 7, 7, Yes], [1, 8, 8, Yes], [2, 9, 9, Yes], [3, 0, 0, Yes], [4, 1, 1, Yes], [5, 2, 2, Yes], [6, 3, 3, Yes], [7, 4, 4, Yes], [8, 5, 5, Yes], [9, 6, 6, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S096

S098 · implies

Before

ORIGINAL group pair(g,h)=[9, 5];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 8, 8, Yes], [1, 9, 9, Yes], [2, 0, 0, Yes], [3, 1, 1, Yes], [4, 2, 2, Yes], [5, 3, 3, Yes], [6, 4, 4, Yes], [7, 5, 5, Yes], [8, 6, 6, Yes], [9, 7, 7, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S097

S099 · implies

Before

ORIGINAL group pair(g,h)=[9, 6];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 9, 9, Yes], [1, 0, 0, Yes], [2, 1, 1, Yes], [3, 2, 2, Yes], [4, 3, 3, Yes], [5, 4, 4, Yes], [6, 5, 5, Yes], [7, 6, 6, Yes], [8, 7, 7, Yes], [9, 8, 8, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S098

S100 · implies

Before

ORIGINAL group pair(g,h)=[9, 7];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 0, 0, Yes], [1, 1, 1, Yes], [2, 2, 2, Yes], [3, 3, 3, Yes], [4, 4, 4, Yes], [5, 5, 5, Yes], [6, 6, 6, Yes], [7, 7, 7, Yes], [8, 8, 8, Yes], [9, 9, 9, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S099

S101 · implies

Before

ORIGINAL group pair(g,h)=[9, 8];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 1, 1, Yes], [1, 2, 2, Yes], [2, 3, 3, Yes], [3, 4, 4, Yes], [4, 5, 5, Yes], [5, 6, 6, Yes], [6, 7, 7, Yes], [7, 8, 8, Yes], [8, 9, 9, Yes], [9, 0, 0, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S100

S102 · implies

Before

ORIGINAL group pair(g,h)=[9, 9];check ALL k in Fin(10)

After

ordered [k,(g*h)*k,g*(h*k),equal] rows=[[0, 2, 2, Yes], [1, 3, 3, Yes], [2, 4, 4, Yes], [3, 5, 5, Yes], [4, 6, 6, Yes], [5, 7, 7, Yes], [6, 8, 8, Yes], [7, 9, 9, Yes], [8, 0, 0, Yes], [9, 1, 1, Yes]]

Conditions: none

Compute both parenthesizations in the complete original table without assuming cyclicity,commutativity or replacement of multiplication by integer addition.

Step identifiers and dependencies

Rule: groupaction_complete_group_associativity_not_cyclic_assumption · Uses: G001, S101

S103 · implies

Before

ORIGINAL group element g=0;DECLARED identity=3;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 7, 7, No], [1, 8, 8, No], [2, 9, 9, No], [3, 0, 0, No], [4, 1, 1, No], [5, 2, 2, No], [6, 3, 3, Yes], [7, 4, 4, No], [8, 5, 5, No], [9, 6, 6, No]]

After

first actual two-sided inverse witness=6;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S102

S104 · implies

Before

ORIGINAL group element g=1;DECLARED identity=3;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 8, 8, No], [1, 9, 9, No], [2, 0, 0, No], [3, 1, 1, No], [4, 2, 2, No], [5, 3, 3, Yes], [6, 4, 4, No], [7, 5, 5, No], [8, 6, 6, No], [9, 7, 7, No]]

After

first actual two-sided inverse witness=5;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S103

S105 · implies

Before

ORIGINAL group element g=2;DECLARED identity=3;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 9, 9, No], [1, 0, 0, No], [2, 1, 1, No], [3, 2, 2, No], [4, 3, 3, Yes], [5, 4, 4, No], [6, 5, 5, No], [7, 6, 6, No], [8, 7, 7, No], [9, 8, 8, No]]

After

first actual two-sided inverse witness=4;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S104

S106 · implies

Before

ORIGINAL group element g=3;DECLARED identity=3;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 0, 0, No], [1, 1, 1, No], [2, 2, 2, No], [3, 3, 3, Yes], [4, 4, 4, No], [5, 5, 5, No], [6, 6, 6, No], [7, 7, 7, No], [8, 8, 8, No], [9, 9, 9, No]]

After

first actual two-sided inverse witness=3;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S105

S107 · implies

Before

ORIGINAL group element g=4;DECLARED identity=3;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 1, 1, No], [1, 2, 2, No], [2, 3, 3, Yes], [3, 4, 4, No], [4, 5, 5, No], [5, 6, 6, No], [6, 7, 7, No], [7, 8, 8, No], [8, 9, 9, No], [9, 0, 0, No]]

After

first actual two-sided inverse witness=2;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S106

S108 · implies

Before

ORIGINAL group element g=5;DECLARED identity=3;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 2, 2, No], [1, 3, 3, Yes], [2, 4, 4, No], [3, 5, 5, No], [4, 6, 6, No], [5, 7, 7, No], [6, 8, 8, No], [7, 9, 9, No], [8, 0, 0, No], [9, 1, 1, No]]

After

first actual two-sided inverse witness=1;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S107

S109 · implies

Before

ORIGINAL group element g=6;DECLARED identity=3;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 3, 3, Yes], [1, 4, 4, No], [2, 5, 5, No], [3, 6, 6, No], [4, 7, 7, No], [5, 8, 8, No], [6, 9, 9, No], [7, 0, 0, No], [8, 1, 1, No], [9, 2, 2, No]]

After

first actual two-sided inverse witness=0;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S108

S110 · implies

Before

ORIGINAL group element g=7;DECLARED identity=3;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 4, 4, No], [1, 5, 5, No], [2, 6, 6, No], [3, 7, 7, No], [4, 8, 8, No], [5, 9, 9, No], [6, 0, 0, No], [7, 1, 1, No], [8, 2, 2, No], [9, 3, 3, Yes]]

After

first actual two-sided inverse witness=9;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S109

S111 · implies

Before

ORIGINAL group element g=8;DECLARED identity=3;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 5, 5, No], [1, 6, 6, No], [2, 7, 7, No], [3, 8, 8, No], [4, 9, 9, No], [5, 0, 0, No], [6, 1, 1, No], [7, 2, 2, No], [8, 3, 3, Yes], [9, 4, 4, No]]

After

first actual two-sided inverse witness=8;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S110

S112 · implies

Before

ORIGINAL group element g=9;DECLARED identity=3;ALL [h,g*h,h*g,two_sided_inverse] rows=[[0, 6, 6, No], [1, 7, 7, No], [2, 8, 8, No], [3, 9, 9, No], [4, 0, 0, No], [5, 1, 1, No], [6, 2, 2, No], [7, 3, 3, Yes], [8, 4, 4, No], [9, 5, 5, No]]

After

first actual two-sided inverse witness=7;exists=Yes

Conditions: none

For each g,the same h must satisfy both inverse identities.An unqualified candidate table may have no witness;retain None rather than guessing inverses from labels.

Step identifiers and dependencies

Rule: groupaction_each_element_actual_two_sided_inverse · Uses: G001, S111

S113 · implies

Before

structurally closed COMPLETE group candidate;two-sided identity=Yes;ALL-triple associativity=Yes;ALL-element inverses=Yes

After

group_valid=Yes is the CONJUNCTION;False remains a reported candidate result,not a silent repair

Conditions: none

Group qualification is the conjunction of these complete obligations.A permutation-looking action table cannot repair a bad group table;do not replace the identity or modify the table.

Step identifiers and dependencies

Rule: groupaction_group_axiom_conjunction_candidate_may_fail · Uses: G001, S112

S114 · implies

Before

CURRENT ORIGINAL complete Cayley table=[[7, 8, 9, 0, 1, 2, 3, 4, 5, 6], [8, 9, 0, 1, 2, 3, 4, 5, 6, 7], [9, 0, 1, 2, 3, 4, 5, 6, 7, 8], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], [1, 2, 3, 4, 5, 6, 7, 8, 9, 0], [2, 3, 4, 5, 6, 7, 8, 9, 0, 1], [3, 4, 5, 6, 7, 8, 9, 0, 1, 2], [4, 5, 6, 7, 8, 9, 0, 1, 2, 3], [5, 6, 7, 8, 9, 0, 1, 2, 3, 4], [6, 7, 8, 9, 0, 1, 2, 3, 4, 5]];actual identity=3;order=10

After

ALL group axioms qualified;actual inverse list=[6, 5, 4, 3, 2, 1, 0, 9, 8, 7];no point carrier or group-action assumption is used

Conditions: none

Certify closure,identity,associativity and two-sided inverses in the group table itself.Do not import an old8-element action-table limit or assume cyclicity/commutativity.The frozen pure helper receives only this question's table and trace.

Step identifiers and dependencies

Rule: group_CURRENT_complete_certified_Cayley_NOT_action_wrapper · Uses: G001, S113

S115 · implies

Before

Cauchy ORIGINAL prime divisor:ORIGINAL integer=2;complete possible trial divisors=[]

After

ALL [divisor,remainder] rows=[];prime=Yes;a composite>1 has a factor at most its square root

Conditions: none

Check the entire square-root divisor range.The empty range qualifies prime2,but not0 or1.Samples,square tables or an Euler criterion do not replace primality qualification.

Step identifiers and dependencies

Rule: finite_prime_ALL_trial_divisors_through_square_root · Uses: G001, S114

S116 · implies

Before

CURRENT qualified group order=10;ORIGINAL prime p=2;divisibility remainder=0

After

product-e p-tuples have count |G|^(p-1)=10^1;cyclic rotation preserves product e by conjugation;rotation orbits have size1 or p;fixed tuples are(g,...,g) with g^p=e

Conditions: none

Choose the first p−1 elements freely;the last is uniquely the inverse product.Rotation conjugates the original product,so preserves e without commuting factors.Primality makes periods1 or p;the total count is divisible by p,so the fixed-solution count is too.Including the identity gives at least p solutions and a nonidentity one whose exact order divides p and hence equals p.This is a general argument,not enumeration of astronomical tuples.

Step identifiers and dependencies

Rule: cauchy_prime_divisibility_and_general_rotation_count_not_enumeration · Uses: G001, S115

Reverse checks

  • S116 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S115 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S114 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S113 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S112 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S111 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S110 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S109 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S108 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S107 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S106 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S105 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S104 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S103 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S102 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S101 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S100 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S099 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S098 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S097 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S096 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S095 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S094 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S093 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S092 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S091 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S090 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S089 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S088 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S087 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S086 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S085 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S084 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S083 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S082 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S081 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S080 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S079 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S078 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S077 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S076 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S075 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S074 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S073 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S072 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S071 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S070 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S069 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S068 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S067 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S066 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S065 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S064 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S063 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S062 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S061 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S060 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S059 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S058 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S057 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S056 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S055 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S049 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S048 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S047 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S044 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S038 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S037 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S036 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S033 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S032 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S031 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S027 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S026 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S025 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S022 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S021 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S020 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S016 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S015 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S014 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S011 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S010 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S009 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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 — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S005 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • S004 · premise_and_result_audit — Check against the original data and this step's premises; a one-way implication is not an equivalence.
  • 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

(10, 2, Yes, 0, complete_group_and_prime_divisibility_hypotheses_hold)

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: 5518e826d62ae2beb6a702e85344cba5fe43d9eda2e153fe1cc5747fc1396aa0
  • candidate record SHA-256: d02aff14fb9409ae00f8e6b4b80460177032ec67869f0dee30ce752504deb568
  • semantic review receipt SHA-256: 357d7ad7a6726b2a757558d3b9586a408ade06526cc023da093719c292704438
  • question-first witness SHA-256: 99cefe17e98c7a74321801cf72df6d02fc95b6a6b78aa335accb7e11ed467b2a
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON