Research interests: Computational number theory, Integer factorization,


       Primality testing, Algorithms, Complexity, Computer aided researches

Office Address: Mathematics Department, Anhui Normal University
                                241000 Wuhu, Anhui, P. R. China

Education: Ph. D, 1993, Math. Dept, Univ. of Limoges, France;
          Master, 1981, Math. Dept,  Anhui Normal Univ., China;
          Bachelor, 1970, Dept. Automation, Tsing Hua Univ., China

Publications:  (in chronological order, most recent first)

● published in international journals:

[15] wait and see ....

[14] Two  kinds of strong pseudoprimes up to 10³⁶, Mathematics of Computation, 76:260 (2007), 2095-2107.  MR2336285 (2008h:11114)             

       http://www.ams.org/mcom/2007-76-260/S0025-5718-07-01977-1/home.html    

[13] (with Weiping Zhou and Xianbei Liu) A generalised Lucasian primality test, Bulletin of the Australian Mathematical Society, 

       74:3 (2006), 419-441. MR2273751 (2007i:11163)     

[12]  Notes on Some New Kinds of Pseudoprimes, Mathematics of Computation, 75:253 (2006), 451-460.MR2176408 (2006e:11013)    

        http://www.ams.org/mcom/2006-75-253/S0025-5718-05-01775-8/home.html     

[11] Finding C3 -Strong Pseudoprimes, Mathematics of Computation, 74:250 (2005), 1009-1024. MR2114662 (2005k:11243)

    http://www.ams.org/mcom/2005-74-250/S0025-5718-04-01693-X/home.html    

[10] (with TANG Min) Finding Strong Pseudoprimes to Several Bases. II, Mathematics of Computation, 72:244 (2003), 2085-2097. 

         MR 1986825 (2004c :11008)  http://www.ams.org/journal-getitem?pii=S0025-5718-03-01545-X   

[9]  A One-Parameter Quadratic-Base Version of the Baillie-PSW Probable Prime Test, Mathematics of Computation,71:240 (2002),

        1699-1734. MR1933051 (2003f:11191)  http://www.ams.org/journal-getitem?pii=S0025-5718-02-01424-2   

[8] Using Lucas Sequences to Factor Large Integers near Group Orders,   The Fibonacci Quarterly, 39:3 (2001),  228-237. 

      MR 1840030 (2002c:11173)  http://www.engineering.sdstate.edu/~fib/fibprevious.html#39.3    

      ps file of this paper available at  http://www.crypto-world.com/FactorPapers.html

[7] Finding Strong Pseudoprimes to Several Bases, Mathematics of Computation, 70:234 (2001), 863-872. 

       MR 1697654 (2001g:11009)  http://www.ams.org/journal-getitem?pii=S0025-5718-00-01215-1   

[6] Finding finite B2-sequences with larger m-am1/2,Mathematics of Computation, 63:207 (1994), 403-414. MR1223235 (94k:11109)

[5] (with P. Erdös) Upper bound of  Σ 1/(ai log ai)  for quasi-primitive sequences, Computers Math. Applic., 26:3 (1993), 1-5.            

      MR 1221192 (94f:11013) 

[4] On a problem of Erdös concerning primitive sequences, Mathematics of Computation, 60:202 (1993), 827-834. MR1181335 (93k:11120)

[3] A B2-sequence with larger reciprocal sum, Mathematics of Computation, 60:202 (1993), 835-839.  MR1181334 ( 93m :11012) 

[2]  (with P. Erdös)  Upper bound of  Σ 1/(ai log ai) for primitive sequences, Proc. Amer. Math. Soc., 117:4 (1993), 891-895. MR1116257 (93e:11018)

[1] On a conjecture of Erdös on the sum Σ p<n 1/(p log p), J. Number Theory, 39:1 (1991), 14-17. MR1123165 (92f:11131)

● published in Chinese journals, written in Chinese with English abstracts:..

[C10] On the complexity of an improved algorithm for matrix multiplications, Journal of Mathematical Research and Exposition, 

19:4  (1999), 716-718. Zbl. 0945.65045

[C9] Design and implementation of a multiple precision arithmetic package, Computer Research and Development, 33:7 (1996), 513-516.

[C8] Implementation of the primality testing algorithm with Jacobi sums on PCs, Computer Engineering & Science, 18:2 (1996), 23-28.

[C7] Comments on "Estimation of time about the optimal algorithms for matrix  multiplication and integer convolution", 

        Mathematica Numerica Sinica, 18:1  (1996), 8-11. Zbl. 0875.65057

[C6] (with ZENG Kencheng) Factorization of an integer with 53 digits, Computer Research and Development, 32:6 (1995), 1-4.

[C5] (with PEI Dingyi) Analysis on the time complexity of multiple precision algorithm, Mathematics in Practice and Theory, 

        No.3 (1994), 74-76. Zbl.832.11047.

[C4] On the complexity of an algorithm for integer vector convolutions, Mathematica Numerica Sinica, 15:1 (1993), 93-94. 

       MR 1393859 (97c:65215); Zbl.0850.65080

[C3] On the complexity of an algorithm for matrix multiplications, Journal of Mathematical Research and Exposition, 

       12:3 (1992), 473-475. MR1191087; Zbl.796.68120 

[C2] Implementation of the quadratic sieve for factoring large integers on an IBM-PC,  Communications Security, No.2 (1991), 47-49.

[C1] A note on the complexity of Euclidean algorithm, Computer Research and Development, 27:12 (1990), 59. 

       Russian Abstacts (Automation and Computational technology), No.11-12 (1992) : 11B73. 

Honors and Awards:
1997 Anhui Province Higher Learning Institutions Science and Technique Progress Awards: the first prize;
1998 Anhui Province Natural Science Awards: the second prize;
2000 NSF of China  Grant: 10071001;
2001 SF of Anhui Province  Grant: 01046103;
2002 SF of the Education Department of Anhui Province  Grant: 2002KJ131.

Last updated July 22, 2009