Mark Dickinson <dicki...@gmail.com> added the comment:
Put me down for a -1, too. > One would also be able to things like prod(range(1, n), n) == n - 1 for > Wilson's primality test. That's not the most convincing use-case, since that's a _horribly_ inefficient way to do a primality test in the first place (worse than trial division, even if you take that trial division all the way up to `n - 1` instead of the square root of `n`). ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <https://bugs.python.org/issue35996> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
