I need this coding done using python!

Most modern computer cryptography works by using the prime factors of large numbers. ... Primes are of the utmost importance to number theorists because they are the building blocks of whole numbers, and important to the world because their odd mathematical properties make them perfect for many uses.

The code below will print out the first 50 prime numbers. As is often the case, there are parts of the code (specifically the FOR loop here) that you have not studied yet. But you should be able to make a pretty good guess. In any case, the actual code that checks for primes need not be modified for this assignment. It's the outer loop that you will work on.

***********************************************************************

import math

sum = 0

i = 2

while sum

i = i + 1

is_prime = True

for j in range(2, int(math.sqrt(i)+1)):

if i % j == 0:

is_prime = False

if is_prime:

print(i)

sum = sum + 1

Here's what you need to do.

A twin prime is a prime number that is either 2 less or 2 more than another prime numberfor example, either member of the twin prime pair (3-5) (5-7) (11-13) (41, 43). In other words, a twin prime is a prime that has a prime gap of two. Sometimes the term twin prime is used for a pair of twin primes; an alternative name for this is prime twin or prime pair.

C level: Modify the program to print out the first 20 prime twins. B/A Level Version 1: Investigate Brun's Theory. Specifically The convergence to Brun's constant. In number theory, Brun's theorem states that the sum of the reciprocalsof the twin primes (pairs of prime numbers which differ by 2) converges to a finite value known as Brun's constant, usually denoted by B2 Level B/A Version 2 Work backwards. Given a number (not too big, we'll talk about that in a advanced class) report if it is a prime number. Do this by modifying the code given. DO NOT use the Sieve of Eratosthenes