Efficient Way

How to precompute modular multiplicative inverse of (p^i)
where i=0,1,2,3, … n

The only inverse you need is p^{-1}, you can straight multiply out the rest.

1 Like

Thanks :slight_smile: