《python语言程序设计》第6章24题函数求素数回文数 def function prime and palindromic answer code total 4 version 此方法有误

在这里插入图片描述


print("""
6.24-04version 
    Maybe new way 
    solve the problem:
        loop not stop
        prime and palindromic 
    find new point1
    in "def is_prime":
     "return False" this code different position,result different
    find new point2
    variable number_of_primes is no have subtraction, 
    chance
    program is success  
""")


def is_prime(integer_num):
    division_num = 2

    while division_num <= integer_num / 2:
        if integer_num % division_num != 0 and (integer_num // 100 == integer_num % 10):
            return True
        division_num += 1
    return False  # attention this line is indent different result different


def print_prime_numbers(number_of_primes):
    number_primes_per_line = 10
    count = 0
    number = 2
    while count < number_of_primes:
        if is_prime(number):
            count += 1

            print(number, end=" ")
            if count % number_primes_per_line == 0:
                print()
        number += 1
        number_of_primes -= 1


def main():
    print("The first 1000 prime numbers are")
    print_prime_numbers(1000)


main()

结果

在这里插入图片描述

结论,

虽然和原题不一样。但是已经超过我的预期了。谢谢
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

电饭叔

谢谢各位兄弟们的关注,谢谢破费

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值