-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathp003.py
More file actions
32 lines (29 loc) · 753 Bytes
/
p003.py
File metadata and controls
32 lines (29 loc) · 753 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
# -*- coding: utf-8 -*-
"""
Created on Wed May 15 01:17:34 2013
@author: guillermo
"""
def isprime(n):
'''check if integer n is a prime'''
# make sure n is a positive integer
n = abs(int(n))
# 0 and 1 are not primes
if n < 2:
return False
# 2 is the only even prime number
if n == 2:
return True
# all other even numbers are not primes
if not n & 1:
return False
# range starts with 3 and only needs to go up the squareroot of n
# for all odd numbers
for x in range(3, int(n**0.5)+1, 2):
if n % x == 0:
return False
return True
n = 600851475143
for i in range(int(n**0.5) + 1, 0,-1):
if isprime(i) and n%i == 0:
print str(i)
break