ACM_training_number_theory数论.ppt

Continued fraction(cont. 26) Example 10: Given N=41, compute the minimum positive integer solutions for (19) and (20), respectively. j 0 1 2 3 4 5 cj 0 6 4 6 6 4 qj 1 5 5 1 5 5 aj 6 2 2 12 2 2 Pj 6 13 32 397 826 2049 Qj 1 2 5 62 129 320 Continued fraction(cont. 27 over) Thus the period of CF is l=3. Due to (22), the minimum positive integer solution of (19) is Due to (23), the minimum positive integer solution of (20) is Verifying: 20492-41·3202=1 322-41·52=-1 References [1] 潘承洞, 潘承彪. 简明数论. 北京: 北京大学出版社, 1998. 1. [2] 颜松远. 杨思熳等译. 计算数论(第2版). 北京: 清华大学出版社, 2008. 11. [3] 冯克勤, 刘凤梅. 代数与通信. 北京: 高等教育出版社, 2005.5. [4] 吴昊等. ACM程序设计培训教程. 北京: 中国铁道出版社, 2007. 8. [5] 郭嵩山, 李志业, 金涛, 梁锋等. 国际大学生程序设计竞赛例题解. 北京: 电子工业出版社, 2007. 10. [6] D. E. Knuth. The art of computer programming Volume 2: Seminumerical algorithms (Third Edition). Addision-Wesley, 1998. [7] 赵宏宇. 精通C程序设计教程. 成都: 西南交通大学出版社, 2004. 1. [8] 赵宏宇. C++程序设计电子教案. 2000~2009. [9] 赵宏宇. 精通C程序设计教程电子教案. 2007. [10] Micro Soft Development Notebook (MSDN for Visual studio.net 2003). School of Information Science and Technology, Southwest Jiaotong University Zhao Hongyu 7/26/2009 * Miller-Ribin method for quasi-primality testing Lemma 1: If p is a prime number, then Congruence equations(cont. 9) (9) iff. x??1 (mod p). Lemma 2: If the following quadratic congruence equation has solution not equal to ?1 , (10) then m is a composite number (not prime number). Theorem 6(Quasi-primality testing): Given any odd integer m, m can be represented as m=1+2jd, where 2j||(m-1). Randomly choose an integer within 1~m, the so-called b-sequence is defined by Congruence equations(cont. 10) (11) Due to lemma 2, if m is a prime, the b-sequence modulo m results in residue numbers as where ?s represent integers not equal to 1. Congruence equations(cont. 11) Key point: In the b-sequence modulo m result sequence, (a) the result before the first 1 cannot be ?; ( can be the before beginning or -1) (b) 1