#A42 INTEGERS 16 (2016) THE SUM OF BINOMIAL COEFFICIENTS AND INTEGER FACTORIZATION Yingpu Deng Key Laboratory of Mathematics Mechanization, NCMIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, P. R. China
[email protected] Yanbin Pan Key Laboratory of Mathematics Mechanization, NCMIS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, P.R. China
[email protected] Received: 10/22/14, Revised: 1/18/16, Accepted: 6/3/16, Published: 6/10/16 Abstract The combinatorial sum of binomial coefficients n n n k (a) := a − i k r k i (mod r) ✓ ◆ ⌘ X has been studied widely in combinatorial number theory, especially when a = 1 and a = 1. In this paper, we connect it with integer factorization for the first time. − More precisely, given a composite n, we prove that for any a coprime to n there exists a modulus r such that the combinatorial sum has a nontrivial greatest common divisor with n. Denote by FAC(n, a) the least r. We present some elementary upper bounds for it and believe that some bounds can be improved further since FAC(n, a) is usually much smaller in the experiments. We also proposed an algorithm based on the combinatorial sum to factor integers. Unfortunately, it does not work as well as the existing modern factorization methods. However, our method yields some interesting phenomena and some new ideas to factor integers, which makes it worthwhile to study further. 1. Introduction Let n, i, r and a be integers with n > 0 and r > 0.