Here's a start
umbers=[True]*5001
index=2
primes=[]
while index<5000:
multiplier=2
while index*multiplier <= 5000:
Numbers[index*multiplier]=False
multiplier+=1
index+=1
while Numbers[index]==False and index < 5000:
index+=1
for x in range(0,5000):
if Numbers[x]==True:
primes.append(x)
x+=1
print primes
The 1000th is 7919, so the 1001st is 7927.
There's no solution. For two primes to add to an odd number, one of them would have to be two. 63 isn't prime, so there's no solution.
67/100 is the only solution. The number 67 is prime.
The only way two prime numbers add up to an odd number is if one of them is 2. Since 95 isn't prime, there is no solution.
7 is a prime number!
7919.
The 1000th is 7919, so the 1001st is 7927.
1099 is not prime. 1099 = 7 * 157
// Print prime number series. class prime { void main () { int i = 1; int C = 0; int n = 1; int X = 0; while (X != 1000) { if ( n % i n ) { C = 0; n++ ; i = 0; } } i++ ; } } }
the Correct Prime Number To This Number indication Is 1 , 2 , 3 , & 5 Thank You . The Solution
There's no solution. For two primes to add to an odd number, one of them would have to be two. 63 isn't prime, so there's no solution.
67/100 is the only solution. The number 67 is prime.
If you just want a hint: One way to check whether a number is prime is by dividing it by any number between 2 and the square root of your number. If the number divides by any of these, it is not prime. If you want the code: import math for num in range(1,101): if all(num%i!=0 for i in range(2,int(math.sqrt(num))+1)): print num
The only way two prime numbers add up to an odd number is if one of them is 2. Since 95 isn't prime, there is no solution.
You is called a prime number!You is called a prime number!You is called a prime number!You is called a prime number!
They are: 71 73 79 83 and 89 Any prime number has only two factors which are itself and one.
7 is a prime number!