证明素数
来源:学生作业帮助网 编辑:作业帮 时间:2024/06/08 13:24:36
证明素数
证明素数
证明素数
Suppose p is not a prime, then there exists two integers x, y >1, such that p=xy.
take a=x, b=y, we find that
p|ab is true, but p|a and p|b are not.
证明素数
证明素数
证明素数
Suppose p is not a prime, then there exists two integers x, y >1, such that p=xy.
take a=x, b=y, we find that
p|ab is true, but p|a and p|b are not.