We compute the rst N coeecients of the reciprocal r(x) of a given polynomial p(x), (r(x)p(x) = 1 mod x N , p(0) 6 = 0), by using, under the PRAM arithmetic models , O(h log N) time-steps and O((N=h)(1 + 2 ?h log (h) N)) processors, for any h, h = 1; 2; : : : ; log N, provided that O(log m) steps and m processors suuce to perform DFT on m points and that log (0)