python找素因子_使用python计算最大素因子时的内存错误

在尝试找出大数字600851475143的最大素因子时,遇到了内存错误。代码在处理较小数字如13195时能正常运行。问题在于寻找并过滤素数因子的过程中。解决方案可能涉及优化素数检测算法,减少内存消耗。
摘要由CSDN通过智能技术生成

我试图找出一个大数字的最大素数,当我运行这个我遇到一个错误说:

回溯(最近一次调用最后一次):文件“prb3.py”,第45行,在print prime_factor()文件“prb3.py”,第12行,在prime_factor中为n在范围(2,i)中:MemoryError

当我使用像13195这样的小编号运行时它工作正常

"""

Problem:

The prime factors of 13195 are 5, 7, 13 and 29.

What is the largest prime factor of the number 600851475143 ?

"""

import math

def prime_factor():

i=600851475143

factors=[] #list stores all the factors of a number

for n in range(2,i):

if(i%n==0 and (n%2!=0 and n!=2)):

factors.append(n)

"""

Now I have all the factors(which are not even numbers)

Next step is to find prime number from factors list

"""

for factor in factors:

sqr_root=int(math.sqrt(factor))

"""

I take a factor from list and divide it by numbers from 3

to sqroot(factor-1).If I get a 0 as remainder I consider it

as non prime and remove from the list.I apply this only to

factors whose sqr root is greater than 3.If it is less than

3 I divide it by each number between 3 and factor-1.

"""

if(sqr_root<=3):

for num in range(3,factor-1):

if(factor%num==0):

factors.remove(factor)

break

else:

for num in range(3,sqr_root):

if(factor%num==0):

1,1 Top

return len(factors)

if __name__ == "__main__":

print prime_factor()

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值