Project Euler Problem 47

Problem 47

The first two consecutive numbers to have two distinct prime factors are:

14 = 2 × 7
15 = 3 × 5

The first three consecutive numbers to have three distinct prime factors are:

644 = 2 2 × 7 × 23
645 = 3 × 5 × 43
646 = 2 × 17 × 19

Find the first four consecutive integers to have four distinct prime factors. What is the first of these numbers?

首次出现连续两个数均有两个不同的质因数是在:

14 = 2 × 7
15 = 3 × 5

首次出现连续三个数均有三个不同的质因数是在:

644 = 2 2 × 7 × 23
645 = 3 × 5 × 43
646 = 2 × 17 × 19

首次出现连续四个数均有四个不同的质因数时,其中的第一个数是多少?


def isprime(x):
    if x <= 1:
        return False
    for i in range(2,int(x**0.5+1)):
        if x % i == 0:
            return False
    return True

def find_prime(a,b):
    i = a
    while i <= b:
        if isprime(i):
            yield i
        i += 1

def factorize(num,factor):
    ll = find_prime(2,int(num**0.5+1))
    for i in ll:
        if num % i == 0:
            factor.add(i)
            return factorize(int(num/i),factor)
    factor.add(num)
    return factor

string = ''
for i in range(1,200000):
    string += str(len(factorize(i,set())))

print(string.find('4444') + 1)

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值