WORST_CASE(?, O(n^1)) prime0falseprimes0falseprimessxprime1ssxsxprime1x0falseprime1xs0trueprime1xssyandnotdivpssyxprime1xsydivpxy=remxy000false0s1true0and2not1=2rem2prime1prime12divp212.1prime0falseprime0cprimes0falseprimes0c1primessz0prime1ssz0sz0primessz0c2prime1ssz0sz0prime1z00falseprime1z00c3prime1z0s0trueprime1z0s0c4prime1z0ssz1andnotdivpssz1z0prime1z0sz1prime1z0ssz1c5divpssz1z0prime1z0sz1divpz0z1=remz0z10divpz0z1c6prime0primes0primessz0prime1z00prime1z0s0prime1z0ssz1divpz0z1prime0falseprimes0falseprimessz0prime1ssz0sz0prime1z00falseprime1z0s0trueprime1z0ssz1andnotdivpssz1z0prime1z0sz1divpz0z1=remz0z101c00c100c21110c300c400c5211012c600prime1110prime12110divp20001s1110prime0cprimes0c1prime0cprimes0c1primessz0c2prime1ssz0sz0prime1z00c3prime1z0s0c4prime1z0ssz1c5divpssz1z0prime1z0sz1divpz0z1c61c00c100c21110c300c400c5211012c600prime1111prime12110divp20001s11primessz0c2prime1ssz0sz0prime0cprimes0c1primessz0c2prime1ssz0sz0prime1z00c3prime1z0s0c4prime1z0ssz1c5divpssz1z0prime1z0sz1divpz0z1c61c00c100c21110c300c400c5211012c600prime1111prime12120divp20000s1111prime1z0s0c4prime1z0ssz1c5divpssz1z0prime1z0sz1prime0cprimes0c1primessz0c2prime1ssz0sz0prime1z00c3prime1z0s0c4prime1z0ssz1c5divpssz1z0prime1z0sz1divpz0z1c61c00c100c21110c300c400c5211012c600prime1131prime12111divp20003s13prime1z00c3prime0cprimes0c1primessz0c2prime1ssz0sz0prime1z00c3prime1z0s0c4prime1z0ssz1c5divpssz1z0prime1z0sz1divpz0z1c61c00c100c21110c300c400c5211012c600prime1231prime12120divp21000s1211divpz0z1c6prime0cprimes0c1primessz0c2prime1ssz0sz0prime1z00c3prime1z0s0c4prime1z0ssz1c5divpssz1z0prime1z0sz1divpz0z1c6AProVEAProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Statistics for single proof: 100.00 % (8 real / 0 unknown / 0 assumptions / 8 total proof steps)http://aprove.informatik.rwth-aachen.deJohnDoe