You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Fast perfect square checking can be implemented for primitive types (and also possibly big integers) using modular arithmetics. These functions can be useful in number theory related calculations.
The text was updated successfully, but these errors were encountered:
I propose to add the following trait to support perfect power checking (especially perfect square checking)
Fast perfect square checking can be implemented for primitive types (and also possibly big integers) using modular arithmetics. These functions can be useful in number theory related calculations.
The text was updated successfully, but these errors were encountered: