Background
A prime number is a positive integer that is divisible by only 1 and itself. It has no other positive divisors. Prime numbers are also often referred to as "primes" or "irreducible numbers". Some examples of prime numbers are 2, 3, 5, 7, 11, 13, 17, 19. They play an important role in number theory and have many applications in fields like cryptography, coding theory, and construction of pseudorandom number generators.
Task
Define a function find_primes that takes one parameter:
|
|
|
|
|
|
|
[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
|
|
|
|
|
|
When called, the function should return a new list containing only the prime numbers from input_nums.