The twin primes are pairs of primes that have a difference of 2. The first several...

Transcribed Image Text:

The twin primes are pairs of primes that have a difference of 2. The first several twin primes are: (3,5),(5,7),(11,13),... Use the following faster version of isPrime(n) to: (1) print out the first 100 twin primes, 5 per line (2) Find the sum of the first 50 twin primes divided by the sum of the 51st to the find their sum (3) 100th twin primes. (4) For the first 100 twin primes, what consecutive twin primes have the largest gap and what is that gap? For consecutive twin primes (a,b), (c,d), the gap between them is defined to be c- b. Show all your output. You must use isPrime(n) as a helper function. The faster version of isPrime(n) is shown below: import math def isPrime (n): '"Return True if int n > 0 is a prime, OTW returns False.''' if n == 1: return False elif n == 2: return True else: if n % 2 == 0: return False else: for f in range (3, math.ceil ( (math.sqrt (n) )) +1, 2) : if n % f == 0: return False return True The twin primes are pairs of primes that have a difference of 2. The first several twin primes are: (3,5),(5,7),(11,13),... Use the following faster version of isPrime(n) to: (1) print out the first 100 twin primes, 5 per line (2) Find the sum of the first 50 twin primes divided by the sum of the 51st to the find their sum (3) 100th twin primes. (4) For the first 100 twin primes, what consecutive twin primes have the largest gap and what is that gap? For consecutive twin primes (a,b), (c,d), the gap between them is defined to be c- b. Show all your output. You must use isPrime(n) as a helper function. The faster version of isPrime(n) is shown below: import math def isPrime (n): '"Return True if int n > 0 is a prime, OTW returns False.''' if n == 1: return False elif n == 2: return True else: if n % 2 == 0: return False else: for f in range (3, math.ceil ( (math.sqrt (n) )) +1, 2) : if n % f == 0: return False return True

Answer rating: 100% (QA)

import math def isPrimen Return true if int n 0 is prime OTW return False if n 1 return False elif n ... View the full answer