phillip1882 11,465 Posted March 13 Report Share Posted March 13 i don't really understand why this is a fast test.firstly, you would need a number of terms about equal to the prime value. that means a lot of multiplication second you would need to divide by all those terms, also expensive. i see no improvement to trail divide up to square root algorithm. Quote Link to post Share on other sites
HallsofIvy 2 Posted 1 hour ago Report Share Posted 1 hour ago The only reliable "prime test" of a number, n, is to divide n by every prime number less than or equal to [tex]\sqrt{x}[/tex]. Quote Link to post Share on other sites
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.