Problem 3:Largest prime factor

本文详细介绍了如何通过因数分解、筛选质因数并找出最大质数因子的方法来解决给定数学问题。通过Python代码实现,解释了算法步骤和具体应用。
Python3.8

Python3.8

Conda
Python

Python 是一种高级、解释型、通用的编程语言,以其简洁易读的语法而闻名,适用于广泛的应用,包括Web开发、数据分析、人工智能和自动化脚本

原题地址:http://projecteuler.net/problem=3

Largest prime factor

Problem 3

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

What is the largest prime factor of the number 600851475143 ?


大意是:

13195的质数因子有5,7,13和29.

600851475143的最大质数因子是多少?


解法1:

1.进行因数分解

2.筛选出质因数

3.取最大质因数

python代码如下所示:

import math
maxnum = 600851475143L
factorlist = []
prifactorlist = []

def isPrime(num):
    num = int(num) 
    temp = math.floor(math.sqrt(num))+1
    
    while temp > 1:
         if num%temp == 0:
             print temp
             return False
         temp -= 1
    else:
         return True

def getFactors(num):
    temp = 2
    while temp < num:
        if num%temp == 0:
            factorlist.append(temp)
            num /= temp
            temp = 2
        temp += 1
    factorlist.append(num)
    
def maxPrime(num):
    for x in factorlist:
        prifactorlist.append(x)

    return max(prifactorlist)
        
if __name__ == '__main__':
   getFactors(maxnum)
   #print max(factorlist)
   print 'max prime factor of %d is:%d' % (maxnum,maxPrime(maxnum))     
  




注:题目的中文翻译源自http://pe.spiritzhang.com


您可能感兴趣的与本文相关的镜像

Python3.8

Python3.8

Conda
Python

Python 是一种高级、解释型、通用的编程语言,以其简洁易读的语法而闻名,适用于广泛的应用,包括Web开发、数据分析、人工智能和自动化脚本

A-1 Intersection Set of Prime Factors 分数 20 作者 陈越 单位 浙江大学 Given a positive integer n. Select two distinct digits from the decimal repersentation(十进制表示)of n, we obtain another integer m. What is the size of the intersection set(交集)of the prime factors of n and m? For example, given n=623457198, its prime factor set is A = {2, 3, 7, 13, 380621}. Swapping 2 and 9 gives us m=693457128, of which the prime factor set is B = {2, 3, 7, 13, 109, 971}. Then the intersection set of A and B is {2, 3, 7, 13}, with 4 factors. Input Specification: Each input file contains one test case, which gives a positive integer n (10<n≤10 9 ). It is guaranteed that there are at least 2 distinct digits in n. Output Specification: Swap any pair of digits in n to obtain m, you are supposed to find the m with the largest intersection set of the prime factors of n and m. Output in a line the number of the prime factors in the intersection set, together with m. The numbers must be separated by 1 space, and there must be no extra space at the beginning or the end of the line. In case such an m is not unique, output the one with the smallest value. Sample Input: 623457198 Sample Output: 4 123457698 Hint: There are two m&#39;s with 4 common factors. Besides the one given in the problem description, we can also swap 6 and 1 to obtain 123457698. This number has a prime factor set {2, 3, 7, 13, 23, 29, 113}, and so the intersection set is also {2, 3, 7, 13}. This number is in the ouput because it is smaller than 693457128.(c++)
最新发布
07-28
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值