Project Euler Problem 51

最新推荐文章于 2025-01-15 12:14:50 发布

原创最新推荐文章于 2025-01-15 12:14:50 发布 · 250 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Project Euler

Project Euler 专栏收录该内容

56 篇文章

订阅专栏

本文探讨了一种数学问题，即找到最小的素数，当该素数的部分数字被替换为相同的数字时（不一定是相邻的），可以生成八个素数值。文章提供了一个具体的Python程序示例来解决这个问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem 51

By replacing the 1^st digit of the 2-digit number *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime.

By replacing the 3^rd and 4^th digits of 56**3 with the same digit, this 5-digit number is the first example having seven primes among the ten generated numbers, yielding the family: 56003, 56113, 56333, 56443, 56663, 56773, and 56993. Consequently 56003, being the first member of this family, is the smallest prime with this property.

Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an eight prime value family.

将两位数*3的第一个数字代换为任意数字，在九个可能值中有六个是素数：13、23、43、53、73和83。

将五位数56**3的第三和第四位数字代换为相同的任意数字，就得到了十个可能值中有七个是素数的最小例子，这个素数族是：56003、56113、56333、56443、56663、56773和56993。56003作为这一族中最小的成员，也是最小的满足这个性质的素数。

通过将部分数字（不一定相邻）代换为相同的任意数字，有时能够得到八个素数，求满足这一性质的最小素数。

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

def solve():
    mode = ['aaabb','aabab','aabba','ababa','abbaa',
            'abaab','babaa','baaba','baaab','bbaaa']
    for stri in mode:
        for i in range(10):
            stri1 = stri.replace('b', str(i), 1)
            for j in range(10):
                stri2 = stri1.replace('b', str(j), 1)
                for m in [1,3,7,9]:
                    stri3 = stri2 + str(m)
                    count = 0
                    for k in range(10):
                        stri4 = stri3.replace('a',str(k))
                        if stri4[0] == '0':
                            continue
                        if isprime(int(stri4)):
                            count += 1
                            if count == 8:
                                print(stri4)
                                

solve()