Skip to content

Commit e5c8e55

Browse files
Create nlargestprime.py
1 parent ff57fc4 commit e5c8e55

File tree

1 file changed

+24
-0
lines changed

1 file changed

+24
-0
lines changed
Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
# To find N digit Largest Prime Number
2+
3+
from math import sqrt
4+
MAX = 100000000
5+
prime = [True] * (MAX + 1)
6+
7+
def SieveOfEratosthenes() :
8+
for p in range(2, int(sqrt(MAX)) + 1) :
9+
if (prime[p] == True) :
10+
for i in range(p * p, MAX + 1, p) :
11+
prime[i] = False
12+
13+
def largestPrime(d) :
14+
l = 10 ** (d - 1)
15+
r = (10 ** d) - 1
16+
for i in range(r, l , -1) :
17+
if (prime[i]) :
18+
return i
19+
return -1
20+
21+
if __name__ == "__main__" :
22+
N = int(input("Enter N digit"))
23+
SieveOfEratosthenes()
24+
print(largestPrime(N))

0 commit comments

Comments
 (0)