CYCLES	|	TASK
------------------------------------------
    0       |   Shift left A-Q pair (A-Q << 1)
------------------------------------------
    1       |   A = A-M ; A_prev <= A;
------------------------------------------
    2       |   if (A[msb] == 1)
                { 
                    Q[0] = 1;
                }
                else
                {
                    Q[0] = 0
                    A <= A_prev
                }
                n <= n-1
------------------------------------------
    3       |   if (n==0)
                {
                    done    //  Remainder in A; Quotient in Q; 
                }
                else
                {
                    goto cycle 0;
                }