- UID
- 1190313
- 在线时间
- 小时
- 注册时间
- 2016-2-10
- 最后登录
- 1970-1-1
- 主题
- 帖子
- 性别
- 保密
|
157 条件2
Proof:
suppose every prime factor of n exists in set P. (we are trying to prove this is not true by reaching a contradiction.)
let P = {p1, p2,....pm}.
now we know n=p1*p2*....*pm+1, this means n is greater than 1, and the greatest common divisor between n and p1*p2*...*pm is 1.
let's write n =( pa^x1)*(pb^x2)*...*(pk^xk). where pa, pb,... px are prime factors of n, x1,x2,...xk are exponents of prime factors of n.
note that we assumed that all prime factors of n are in set P, so pa is in set P, pb is in set P,... pk is in set P.
now let's look at the greatest common divisor between n=( pa^x1)*(pb^x2)*...*(pk^xk), and p1*p2*...*pm. Since pa is in set P, pb is in set P, ... px is in set P, the greatest common divisor between n and p1*p2*...*pm is pa*pb*...*px. and since n is >1, pa*pb*...*px is also greater than 1, therefore we reached a contradiction.
Thus there exists a prime factor of n such that this prime factor is not in set P.
感觉有点奥数做证明了哈哈。
|
|