Python 实现：将大于 6 的偶数分解为两个素数之和

```python oneint = 0 def inputint(): global oneint while True: num = int(input("请输入一个大于 6 的偶数: ")) if num > 6 and num % 2 == 0: oneint = num break else: print("输入不符合要求，请重新输入") def isprime(n): if n <= 1: return False if n <= 3: return True if n % 2 == 0 or n % 3 == 0: return False i = 5 while i * i <= n: if n % i == 0 or n % (i + 2) == 0: return False i += 6 return True def main(): inputint() found = False for i in range(2, oneint // 2 + 1): if isprime(i) and isprime(oneint - i): print(f"{oneint} 可以分解为 {i} 和 {oneint - i} 两个素数之和") found = True break if not found: print("无法分解为两个素数之和") if __name__ == "__main__": main() ``` ######[AI写代码神器 | 303点数解答 | 2024-11-09 10:49:54]