Explore related knowledge and questions →

Question 941: The First Positive Power Returning to One Defines the Order

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 5

← Question derivation index · Original question batch

P1000-0941 · q-20261015-advance-20261116-r07-multiplicative-order-mod-n-0041

Original question and givens

Use exact modulus n=18 and integer a=5. First require n≥2 and normalize a modulo n into the canonical nonnegative residue, then require gcd(a,n)=1. The order is the least positive return exponent, not any return. Give (power_rows, order, no_earlier_return, returns_one, certificate).

  • G001 — Use exact modulus n=18 and integer a=5. First require n≥2 and normalize a modulo n into the canonical nonnegative residue, then require gcd(a,n)=1. The order is the least positive return exponent, not any return. Give (power_rows, order, no_earlier_return, returns_one, certificate).

Definition and scope

Require n≥2 and a normalized residue coprime to n. The order is the first positive exponent returning to 1.

Step-by-step derivation

S001 · implies

Before

n=18; a=5

After

order is defined here only for n≥2 and units modulo n

Conditions: none

Fix this node's domain first; do not confuse additive and multiplicative order.

Step identifiers and dependencies

Rule: order_domain · Uses: G001

S002 · implies

Before

a=5

After

normalized residue=5; gcd(5,18)=1

Conditions: none

Normalize even a negative representative into[0,n), then test coprimality.

Step identifiers and dependencies

Rule: normalize_and_qualify · Uses: G001, S001

S003 · implies

Before

gcd(residue,n)=1; units=[1, 5, 7, 11, 13, 17]

After

phi(18)=6

Conditions: none

Enumerate every coprime class from0 through n−1; phi is the complete unit-carrier size.

Step identifiers and dependencies

Rule: complete_unit_enumeration · Uses: G001, S002

S004 · calculation

Before

power product at k=1 := mul(1, 5)

After

power product at k=1 = 5

Conditions: none

Multiply the preceding power representative by the same normalized base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S003

S005 · implies

Before

product=5

After

a^1 mod 18=5

Conditions: none

The remainder is the next full power representative.

Step identifiers and dependencies

Rule: reduce_next_power · Uses: G001, S004

S006 · calculation

Before

power product at k=2 := mul(5, 5)

After

power product at k=2 = 25

Conditions: none

Multiply the preceding power representative by the same normalized base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S005

S007 · implies

Before

product=25

After

a^2 mod 18=7

Conditions: none

The remainder is the next full power representative.

Step identifiers and dependencies

Rule: reduce_next_power · Uses: G001, S006

S008 · calculation

Before

power product at k=3 := mul(7, 5)

After

power product at k=3 = 35

Conditions: none

Multiply the preceding power representative by the same normalized base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S007

S009 · implies

Before

product=35

After

a^3 mod 18=17

Conditions: none

The remainder is the next full power representative.

Step identifiers and dependencies

Rule: reduce_next_power · Uses: G001, S008

S010 · calculation

Before

power product at k=4 := mul(17, 5)

After

power product at k=4 = 85

Conditions: none

Multiply the preceding power representative by the same normalized base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S009

S011 · implies

Before

product=85

After

a^4 mod 18=13

Conditions: none

The remainder is the next full power representative.

Step identifiers and dependencies

Rule: reduce_next_power · Uses: G001, S010

S012 · calculation

Before

power product at k=5 := mul(13, 5)

After

power product at k=5 = 65

Conditions: none

Multiply the preceding power representative by the same normalized base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S011

S013 · implies

Before

product=65

After

a^5 mod 18=11

Conditions: none

The remainder is the next full power representative.

Step identifiers and dependencies

Rule: reduce_next_power · Uses: G001, S012

S014 · calculation

Before

power product at k=6 := mul(11, 5)

After

power product at k=6 = 55

Conditions: none

Multiply the preceding power representative by the same normalized base.

Step identifiers and dependencies

Rule: exact_rational_arithmetic · Uses: G001, S013

S015 · implies

Before

product=55

After

a^6 mod 18=1

Conditions: none

The remainder is the next full power representative.

Step identifiers and dependencies

Rule: reduce_next_power · Uses: G001, S014

S016 · implies

Before

all positive k<=6: [[1, 5], [2, 7], [3, 17], [4, 13], [5, 11], [6, 1]]

After

first positive return to1 occurs at k=6

Conditions: none

Every smaller positive exponent has been checked not to return to1; the identity at exponent0 is not the order.

Step identifiers and dependencies

Rule: least_positive_return · Uses: G001, S015

Reverse checks

  • S016 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
  • S015 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
  • S014 · premise_and_result_audit — Recompute power product at k=6 with exact rational arithmetic, not rounded decimals.
  • S013 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
  • S012 · premise_and_result_audit — Recompute power product at k=5 with exact rational arithmetic, not rounded decimals.
  • S011 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
  • S010 · premise_and_result_audit — Recompute power product at k=4 with exact rational arithmetic, not rounded decimals.
  • S009 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
  • S008 · premise_and_result_audit — Recompute power product at k=3 with exact rational arithmetic, not rounded decimals.
  • S007 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
  • S006 · premise_and_result_audit — Recompute power product at k=2 with exact rational arithmetic, not rounded decimals.
  • S005 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
  • S004 · premise_and_result_audit — Recompute power product at k=1 with exact rational arithmetic, not rounded decimals.
  • S003 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
  • S002 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.
  • S001 · premise_and_result_audit — Order is the first positive return to1; check n≥2 and coprimality first, and do not assert order=phi.

Result

([[1, 5], [2, 7], [3, 17], [4, 13], [5, 11], [6, 1]], 6, Yes, Yes, order_is_the_first_positive_return)

The full substitutions and premise audits recover the original answer, retaining its field order and verdict meanings.

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: d0e810f1fcfd3056a1091c7a4eb865173536c0ac512740a9cb10e09dd2bfeca0
  • candidate record SHA-256: 5e31cb02e0f2c5b17f099f867d1d1a3759e7ec63c5eecbc3bc00d3e1d0f6089d
  • semantic review receipt SHA-256: 6c2c6d46aded7582a11ac41a8c0b3bdde2669a53bdb6e796eea2039994a02772
  • question-first witness SHA-256: 77e43898df9efdbf8094ad81fe4ab91cf4b4bd82f481eb9b4699b73cb4da612b
  • Lean: NOT_RUN · human review: NOT_PERFORMED
Same-source full JSON