Question

Please use python and show the code you used.

Question 2 5 pts from sympy import sieve sieve.extend_to_no(999) primes - set (sieve._list) The code above creates a set of prime numbers, stored in the variable primes. Check whether or not the following list of numbers is prime, by checking if it is in the set primes. Keep the sequence of True/False values in the order given, and express that sequence as a 14-digit binary number. Enter the equivalent decimal integer of that binary number as your answer. [4987, 2849, 117, 2423, 3211, 831, 8707, 2099, 6853, 5601, 709, 4301, 2909, 8311] Here's an example sequence [4,5, 22, 29). Checking which numbers are prime gives [False, True, False, True), which as a binary number is 0101, which as a decimal integer is 5. Note: The correct answer is actually a prime number greater than 9000.

Answer 1

Program Code Screenshot :

Х sieve primes.py - D:7Coding/Python/sieve primes.py (3.7.4) File Edit Format Run Options Window Help from sympy import sieve sieve.extend_to_no (999) primes = set (sieve. _list) #List of integers 1 = [4987,2049,117,2423, 3211,831,8707,2099,6853,5601, 79,4301,2909,8311] #Boolean list d = [x in primes for x in 1] #Binary number b = ".join([str(int (x)) for x in d]) #Convert to decimal print ('Decimal is ', int (b,2))

Sample Output :

RESTART: D: /Coding/Python/sieve primes.py = = = = II II III II II II = = Decimal is 9419

Program Code to Copy (Please refer to the screenshot of the code to understand the indentation of the code)

from sympy import sieve
sieve.extend_to_no(999)
primes = set(sieve._list)
#List of integers
l = [4987,2049,117,2423,3211,831,8707,2099,6853,5601,79,4301,2909,8311]
#Boolean list
d = [x in primes for x in l]
#Binary number
b = ''.join([str(int(x)) for x in d])
#Convert to decimal
print('Decimal is ',int(b,2))