phillip1882 Posted March 13, 2021 Report Share Posted March 13, 2021 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 comment Share on other sites More sharing options...

HallsofIvy Posted April 18, 2021 Report Share Posted April 18, 2021 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 comment Share on other sites More sharing options...

## 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.