Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

4
  • 1
    \$\begingroup\$ (m&31) can be replaced with m%32 \$\endgroup\$ Commented May 8, 2020 at 8:37
  • \$\begingroup\$ @Arnauld A simple but very interesting golf: \$\mod{2^n}\$ is the same as masking the \$n\$ least-significant bits - thanks! :-) \$\endgroup\$ Commented May 8, 2020 at 8:48
  • 1
    \$\begingroup\$ What about m;r;f() -> f(m,r)? \$\endgroup\$ Commented May 8, 2020 at 10:27
  • \$\begingroup\$ @tsh Nice one - thanks! :-) \$\endgroup\$ Commented May 8, 2020 at 11:29