x q: y needs fixing

Currently dyadic q: is hopelessly slow. For example,

`2 q: 30202000`

takes a long time to run, even thought only needs to find if 2 and 3 are factors (and of what order). This is because it tries to sieve for all primes less than y, when we only need the first two. I'll try to sort it out. 
