Abstract
In this paper generator algorithms for prime k-tuples based on the the divisibility properties of binomial coefficients are introduced. The mathematical foundation lies in the connection that exists between binomial coefficients and the number of carries that result in the sum in different bases of the variables that form the binomial coefficent and, characterizations of k-tuple primes in terms of binomial coefficients.
Original language | English |
---|---|
Pages (from-to) | 323-330 |
Number of pages | 8 |
Journal | Neural, Parallel and Scientific Computations |
Volume | 19 |
Issue number | 3-4 |
State | Published - Sep 2011 |