Improved prime_numbers.py

[Leoriem-code]

Describe your change:

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Documentation change?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Python files are placed inside an existing directory.
• All filenames are in all lowercase characters with no spaces or dashes.
• All functions and variable names follow Python naming conventions.
• All function parameters and return values are annotated with Python type hints.
• All functions have doctests that pass the automated testing.
• All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
• If this pull request resolves one or more open issues then the commit message contains Fixes: #{$ISSUE_NO}.

[cclauss]

Please add a timeit benchmark to prove which is faster.

[Leoriem-code]

I did around 80 000 test, and here are the results:

[cclauss]

I increase the timeit number to 1_000_000. My results:

0.13780254199999975
0.09855987499999985
0.09820629199999997

0.13855433299999964
0.09545766600000016
0.095391416

0.1449954579999999
0.09700583299999999
0.09648933399999993