Primes and programming: an introduction to number theory with computing
Primes and programming: an introduction to number theory with computing
Prime numbers and computer methods for factorization (2nd ed.)
Prime numbers and computer methods for factorization (2nd ed.)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A functional recurrence to obtain the prime numbers using the Smarandache prime function
Smarandache Notions Journal
The Mathematica Book
Mathematica in Action
A programming language
| Hi-index | 0.00 |
The sum of powers of positive divisors of an integer, expressed in terms of the floor function, provides the basis for another characterization of twin primes in particular, and of prime k-tuples generally. This elementary characterization is deployed in a software test for prime k-tuples using Mathematica.