Project Euler 3

'''
Created on 2014年8月23日
Largest prime factor
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
@author: wxp2971
'''
from numpy import *
# 直接求解,寻找最大的那个
N = 600851475143
factor = 2
lastFactor = 1
while N > 1:
    if N % factor == 0:
        lastFactor = factor
        while N % factor == 0:
            N = N / factor
    factor += 1
print(lastFactor)

# 对特殊的质数进行筛选
N = 600851475143
if N % 2 == 0 :
    N = N / 2
    lastFactor = 2
    while N % 2 == 0:
        N = N / 2
else:
    lastFactor = 1
factor = 3
while N > 1:
    if N % factor == 0:
        N = N / factor
        lastFactor = factor
        while N % factor == 0:
            N = N  / factor
    factor += 2
print(lastFactor)

# 质因子的最大不会超过sqrt(N)
N = 600851475143
if N % 2 == 0 :
    N = N / 2
    lastFactor = 2
    while N % 2 == 0:
        N = N / 2
else:
    lastFactor = 1
factor = 3
maxFactor = sqrt(N)
while N > 1 and factor <= maxFactor:
    if N % factor == 0:
        N = N / factor
        lastFactor = factor
        while N % factor == 0:
            N = N  / factor
        maxFactor = sqrt(N)
    factor += 2
if N == 1:
    print(lastFactor)
else:
    print(int(N))





  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值