Add a prime checker (classic, witness numbers) #25

Closed
opened 2023-05-12 13:06:42 -04:00 by That-One-Nerd · 1 comment
That-One-Nerd commented 2023-05-12 13:06:42 -04:00 (Migrated from github.com)
No description provided.
That-One-Nerd commented 2023-06-07 07:23:47 -04:00 (Migrated from github.com)

This has been completed. Currently, the Miller-Rabin method (witness numbers) is slightly slower than classic for basically all values of n. However, in the future when Mathf.PowerMod(int, int, int) has been optimized, it will become much faster for very large values of n.

This has been completed. Currently, the Miller-Rabin method (witness numbers) is slightly slower than classic for basically all values of $n$. However, in the future when `Mathf.PowerMod(int, int, int)` has been optimized, it will become much faster for very large values of $n$.
Sign in to join this conversation.
1 Participants
Notifications
Due Date
No due date set.
Dependencies

No dependencies set.

Reference: That-One-Nerd/Nerd_STF#25
No description provided.