Select the first item to observe.
t₀ r is a primitive root modulo l²             none
Proposition 1: Inequality holds Proposition holds
Proposition 2: Inequality holds 2^{2nl^s}≠1 mod p holds Proposition holds
Indivisibility assured by propositions by other Indivisible Divisible
Computation: method volume result fingerprint time note

Select the second item to observe.
t₀ r is a primitive root modulo l²             none
Proposition 1: Inequality holds Proposition holds
Proposition 2: Inequality holds 2^{2nl^s}≠1 mod p holds Proposition holds
Indivisibility assured by propositions by other Indivisible Divisible
Computation: method volume result fingerprint time note

Select the third item to observe.
t₀ r is a primitive root modulo l²             none
Proposition 1: Inequality holds Proposition holds
Proposition 2: Inequality holds 2^{2nl^s}≠1 mod p holds Proposition holds
Indivisibility assured by propositions by other Indivisible Divisible
Computation: method volume result fingerprint time note

Select the search conditions. (arbitrary)
t₀ =<≤>≥  /  r is a prim root: yes no
Proposition 1 holds: yes no  /  Proposition 2 holds: yes no
comp-method: r is a primitive root Criterion 1 Criterion 2
comp-result: exceptional exists no result

Click after the selections.