Produce a list named prime_truths which contains True for prime numbers and False for nonprime numbers in the range [2,100]. We provide a function is_prime to assist you with this. Call it like this: is_prime (5). Use lambda, map, filter, and list comprehensions as you see fit. You should not need to use a conventional for loop outside of a comprehension.

def is_prime (n) : for i in range (2, n) : if (n % i = = 0) : return False return True prime_truths = [is_prime (x) for x in range (2,101) ] print (prime_truths)

Explanation:

The solution code is written in Python 3.

Presume there is a given function is_prime (Line 1 - 5) which will return True if the n is a prime number and return False if n is not prime.

Next, we can use the list comprehension to generate a list of True and False based on the prime status (Line 7). To do so, we use is_prime function as the expression in the comprehension list and use for loop to traverse through the number from 2 to 100. The every loop, one value x will be passed to is_prime and the function will return either true or false and add the result to prime_truth list.

After completion of loop within the comprehension list, we can print the generated prime_truths list (Line 8).