News for hackers. Stuff that matters.
Re:Finding a billion factorials in 60 ms with SIMD by qsort on Monday June 23, 2025 @03:38AM (#44353360)
It's easier to write code for efficiently computing the inverse in that form, roughly:

  int FastExp(int a, int e, int p)
  {
    if (e == 0) return 1;
    if (e == 1) return a;
    if (e % 2 == 0) return FastExp((a*a)%p, e/2, p);
    else return a * FastExp((a*a)%p, e/2, p);
  }
In math competitions where you only have pen and paper, you'd instead turn what you wrote into a Diophantine equation you can solve with the usual method.

There are no comments on this comment yet.