How do i solve this with python with the input json given?

Question

The JSON inputs will be positive integers.

For RSA, we need to select two huge random numbers in real-world scenarios. We can do this by picking a random number and then testing it for primality. This exercise will supply you with an array of positive and representable integers in 32 bits. For each integer, you will output a boolean value of true if it is prime, and false if it is not.

You're welcome to use a fancy probabilistic algorithm, such as the Miller-Rabin test (which is very commonly used in crypto libraries). Still, you should be able to use trial division... even though it might take a while to grade (2^32 is a lot of trials... at least skip even numbers after 2).

Input:

1. numbers: An array of integers to test for primality.

"problem 1" :

{

"numbers" : [3, 4, 5, 6]

},

Answer 1

This is not an efficient algorithm, but it does the job! You can adapt it to your specific input/output needs.

def find_primes(numbers):

"""'numbers' is a list of ints. Return a new list with only the primes."""

primes = list(numbers) # copy the list

for i in range(2, len(primes)):

for prime in primes:

if prime > i and prime % i == 0:

primes.remove(prime)

return primes