Prevent this user from interacting with your repositories and sending you notifications.
Learn more about blocking users.
You must be logged in to block users.
Contact GitHub support about this user’s behavior.
Learn more about reporting abuse.
A very, very fast algorithm for finding all amicable pairs in the specified range
Fast factorization of numbers less than 2^64
Trying to perform 64:32 bit division faster than native x64 DIV instruction.
The fix as suggested by jberman on IRC. Before the fix, it would truncate 1.9 to 1 skewing the output selection.
Seeing something unexpected? Take a look at the
GitHub profile guide.