Deduplicate repeated `is_prime` functions

[poyea]

We have a lot of is_prime (or similar) functions: https://github.com/TheAlgorithms/Python/search?p=4&q=is_prime, https://github.com/TheAlgorithms/Python/search?q=isPrime, data_structures/hashing/number_theory/prime_numbers, etc. Shall we use one common function for that exactly identical is_prime calculation (which takes O(sqrt(n)))?

Candidates include:

• maths/prime_check
• maths/primelib

[srishtik2310]

Can you assign this to me.

[murilo-goncalves]

I will do it!

[VaishnaviJahagirdar3]

Hi! I'm interested in working on this

[Gyan-Singh]

Can I try solve this prob?

[spyboy01]

hey could you please assign it to me .

[paulosgf]

Are there someone working on this fix?

[wellinston123]

Write a function that takes a list sorted in non-decreasing order and deletes any duplicate nodes from the list. The list should only be traversed once.
For example if the linked list is 11->11->11->21->43->43->60 then removeDuplicates() should convert the list to 11->21->43->60. Algorithm:
Traverse the list from the head (or start) node. While traversing, compare each node with its next node. If the data of the next node is the same as the current node then delete the next node. Before we delete a node, we need to store the next pointer of the node.

[paulosgf]

I'd like do it. Is there anyone working on it?

I have started to work on this issue.

[paulosgf]

We have a lot of is_prime (or similar) functions: https://github.com/TheAlgorithms/Python/search?p=4&q=is_prime, https://github.com/TheAlgorithms/Python/search?q=isPrime, data_structures/hashing/number_theory/prime_numbers, etc. Shall we use one common function for that exactly identical is_prime calculation (which takes O(sqrt(n)))?

Candidates include:

• maths/prime_check
• maths/primelib

Hi @poyea!
I think that isn't not too simple to only change is_prime() similar functions by one patter as prime_check() function, because
while, for example, maths.prime_check.prime_check() is defined with def prime_check(number: int) -> bool , maths.miller_rabin.py.is_prime() is defined as def is_prime(n, prec=1000)
I sugests to only change the maths.miller_rabin.py.is_prime() name to something more compatible with his context, as big_num_is_prime().
What do you think?

[nnamansingh]

Do the sorting first and then make it a set as the set will return unique values and by this all the duplicates will be removed