数论入门 素数

掌握的知识点:

  • Prime Numbers
  • Fermat's and Euler's Theorems 
  • Testing for Primality
  • The Chinese Remainder Theorem
  • Discrete Logarithms

 

 Prime Numbers

Prime numbers only have divisors of 1 and self

  • cannot be written as a product of other numbers
  • 1 is prime,but is generally not of interest

 

Prime numbers are central to number theory!

 

List of prime number less than 200 is:

2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199

上面看出素数一定是奇数(except 2),如果是偶数肯定不是素数

 

Prime  factorisation of a number n is when its written as a product of primes: 

其中,P是所有素数的集合,a是任意正整数

比如, 91=7* 13,  3600= 2^4 *  3^2 * 5^2

 

两个数互素的条件:

Two numbers a, b are relatively prime if have no common divisors other than 1.

 

Conversely can determine the greatest common divisor by comparing their prime factorizations and using least powers.

example: 300=2^1 * 3^1 * 5^2 ,   18= 2^1 * 3^2 

thus gcd(18,300)=2^1 * 3^1 *5^0= 6

 

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值