欧几里得定理指出素数有无穷多个。经典的证明方法是反证法。它假设存在一个有限的素数列表 [latex]p_1, p_2, dots, p_n[/latex]。然后考虑数 [latex]P = p_1 p_2 cdots p_n + 1[/latex]。这个数 [latex]P[/latex] 要么是素数,要么不是素数。如果它是素数,那么它就是列表中没有的一个新的素数。

(图片仅供参考)
欧几里得定理指出素数有无穷多个。经典的证明方法是反证法。它假设存在一个有限的素数列表 [latex]p_1, p_2, dots, p_n[/latex]。然后考虑数 [latex]P = p_1 p_2 cdots p_n + 1[/latex]。这个数 [latex]P[/latex] 要么是素数,要么不是素数。如果它是素数,那么它就是列表中没有的一个新的素数。
The proof continues: if [latex]P[/latex] is not prime, it must be divisible by some prime, say [latex]q[/latex]. This prime [latex]q[/latex] must be on our assumed complete list of primes. However, if we divide [latex]P[/latex] by any of the primes [latex]p_i[/latex] from our list, the remainder is always 1. Therefore, none of the primes on our list can be the factor [latex]q[/latex]. This means [latex]q[/latex] must be a prime number that was not on our original list. In either case—whether [latex]P[/latex] is prime or composite—there exists at least one more prime than is contained in any finite list. This contradicts the initial assumption that the set of all primes is finite. Therefore, the set of prime numbers must be infinite. This elegant argument is considered a masterpiece of mathematical reasoning and is often one of the first examples of proof by contradiction taught to students. It appears in Book IX, Proposition 20 of Euclid’s *Elements*.
无限素数(欧几里得证明)
(如果日期未知或不相关,例如“流体力学”,则提供其显著出现的近似估计)
只有注册会员才能免费获得 100% 的全尺寸图片和下载。.
> 登录 <