| variable | means | value | symbol | condition to take the value |
|---|---|---|---|---|
| primroot | r is a primitive root modulo l2 | true/false | O/X | |
| prop1ineq | Inequality in Prop1 holds | true/false | O/X | |
| prop1 | Prop1 holds | true | P1 | (primroot) and (prop1ineq) |
| false | otherwise | |||
| prop2ineq | Inequality in Prop2 holds | true/false | O/X | |
| not1modp | 22nl^s≠1 mod p | true/false | O/X | |
| prop2 | Prop2 holds | true | P2 | (primroot) and (prop2ineq) and (not1modp) |
| false | otherwise | |||
theoryindiv |
Indivisibility assured theoretically | true | T | (prop1) or (prop2) |
| no value | otherwise | |||
indivisible |
Indivisibility assured theoretically or computationally |
true | T | (theoryindiv) or (compresult='O') |
| false | F | (compresult='A') and (primroot) and (r=2) Divisibility is assured |
||
| no value | otherwise | |||
| divisible | Divisibility assured theoretically or computationally |
true | T | not (indivisible) |
| false | F | (inidivisible) Indivisibility is assured | ||
| no value | otherwise | |||
| compresult | Computational result | O | O | (deg Dt,r = 0) or (deg Ft,r = 0) |
| A | A | (deg Dt,r > 0) or (deg Ft,r > 0) | ||
| no value | not computed | |||
| compvolume | Time complexity (currently,
measured by total size of sp()) |
2n ls(log2p) | compmethod = 'is' | |
| n lf(log2p) | compmethod = 'L1' | |||
| n lt0+s(log2p) | compmethod = 'L2' | |||