Divisibility DB Searcher   Back to the Top Page
Select the search conditions (selection is arbitrary)
l n f r s p t0
r is a primitive root module l2: yes no -
Proposition 1:  Inequality holds:yes no -  | Prop holds: yes no -
Proposition 2:  Inequality holds:yes no -  | 22nl^s≠1 mod p: yes no -  | Prop holds: yes no -
Indivisibility is assured by theory:yes no -  |  Divisible Indivisible Unknown -
comp-method: r is a... Lemma 1 Lemma 2  |  comp-result: exceptional exists no result
l+n+f+r+s
Select the items to be shown (at least one item is necessary) ⓘ
l n f r s p log10p t0  |  r is a primitive root modulo l2 (or not)
Inequality in Prop 1 holds Prop 1 holds
Inequality in Prop 2 holds 22nl^s≠1 mod p Prop 2 holds
Indivisibility assured by theory by other Indivisibility Divisibility
Computation: method volume result logs fingerprint cputime
l+n+f+r+s note
Select the method to show (selection is arbitrary)
frequency distribution order by log10p order by log10p desc
order by l+n+f+r+s order by length of fingerprint
max 20 records max 100 records max 500 records

←click after selection