invFactorial method

List<Modular> invFactorial()

Implementation

List<Modular> invFactorial() {
  int n = value;
  var fac = factorial();
  List<Modular> a = [for (int i = n; i > 0; i--) Modular(i, mod)];
  a[0] = fac[n - 1].inv();
  a = a.cumprod();
  a = a.reversed.toList();
  return a;
}