Optimize nextprime by transitioning from 6n system to 30n system

[mthn1907]

References to other Issues or PRs

Brief description of what is fixed or changed

The nextprime function has been optimized by transitioning from the 6n system to the 30n system for prime candidate selection. This change reduces the number of unnecessary prime checks, improving the overall performance of the algorithm.

Other comments

In the previous implementation, potential primes were located at 6j + {1, 5}. By switching to the 30j + {1, 7, 11, 13, 17, 19, 23, 29} system, we eliminate two additional prime checks per cycle. ( For instance, 30n+5 is also 6n+5. Using this way we skip 30n+5 and 30n+25 ). This adjustment leverages a more efficient pattern for prime candidate selection, leading to faster computations.

Release Notes

• ntheory
  • Optimized nextprime function by switching from 6n + {1,5} system to 30n + {1, 7, 11, 13, 17, 19, 23, 29} system, reducing unnecessary prime checks and improving performance.

[sympy-bot]

✅

Hi, I am the SymPy bot. I'm here to help you write a release notes entry. Please read the guide on how to write release notes.

Your release notes are in good order.

Here is what the release notes will look like:

• ntheory
  • Optimized nextprime function by switching from 6n + {1,5} system to 30n + {1, 7, 11, 13, 17, 19, 23, 29} system, reducing unnecessary prime checks and improving performance. (#26608 by @mthn1907)

This will be added to https://github.com/sympy/sympy/wiki/Release-Notes-for-1.13.

Click here to see the pull request description that was parsed.

#### References to other Issues or PRs
<!-- If this pull request fixes an issue, write "Fixes #NNNN" in that exact
format, e.g. "Fixes #1234" (see
https://tinyurl.com/auto-closing for more information). Also, please
write a comment on that issue linking back to this pull request once it is
open. -->


#### Brief description of what is fixed or changed
The `nextprime` function has been optimized by transitioning from the 6n system to the 30n system for prime candidate selection. This change reduces the number of unnecessary prime checks, improving the overall performance of the algorithm.


#### Other comments
In the previous implementation, potential primes were located at 6j + {1, 5}. By switching to the 30j + {1, 7, 11, 13, 17, 19, 23, 29} system, we eliminate two additional prime checks per cycle. ( For instance, 30n+5 is also 6n+5. Using this way we skip 30n+5 and 30n+25 ). This adjustment leverages a more efficient pattern for prime candidate selection, leading to faster computations. 


#### Release Notes

<!-- Write the release notes for this release below between the BEGIN and END
statements. The basic format is a bulleted list with the name of the subpackage
and the release note for this PR. For example:

* solvers
  * Added a new solver for logarithmic equations.

* functions
  * Fixed a bug with log of integers. Formerly, `log(-x)` incorrectly gave `-log(x)`.

* physics.units
  * Corrected a semantical error in the conversion between volt and statvolt which
    reported the volt as being larger than the statvolt.

or if no release note(s) should be included use:

NO ENTRY

See https://github.com/sympy/sympy/wiki/Writing-Release-Notes for more
information on how to write release notes. The bot will check your release
notes automatically to see if they are formatted correctly. -->

<!-- BEGIN RELEASE NOTES -->
* ntheory
  * Optimized `nextprime` function by switching from 6n + {1,5} system to 30n + {1, 7, 11, 13, 17, 19, 23, 29} system, reducing unnecessary prime checks and improving performance. 
<!-- END RELEASE NOTES -->