public Polynomial diff() {
        if (coeff.length == 0) return this;
        long[] c = new long[coeff.length - 1];
        for (int i = 1; i < coeff.length; i++)
            c[i - 1] = PF.mul(PF.nth(i), coeff[i]);
        return new Polynomial(c);
    }