Facebook Instagram Twitter RSS Feed Back to top

Divisibity, iterated digit sums, primality tests

In: Mathematica Slovaca, vol. 59, no. 3
Larry Ericksen


Year, pages: 2009, 261 - 274
congruence, factorization, Lucas-Lehmer test, primality, prime constellation, recurrence, sum of digits
About article:
The divisibility of numbers is obtained by iteration of the weighted sum of their integer digits. Then evaluation of the related congruences yields information about the primality of numbers in certain recursive sequences. From the row elements in generalized Delannoy triangles, we can verify the primality of any constellation of numbers. When a number set is not a prime constellation, we can identify factors of their composite numbers. The constellation primality test is proven in all generality, and examples are given for twin primes, prime triplets, and Sophie Germain primes.
How to cite:
ISO 690:
Ericksen, L. 2009. Divisibity, iterated digit sums, primality tests. In Mathematica Slovaca, vol. 59, no.3, pp. 261-274. 0139-9918. DOI: https://doi.org/10.2478/s12175-009-0122-7

Ericksen, L. (2009). Divisibity, iterated digit sums, primality tests. Mathematica Slovaca, 59(3), 261-274. 0139-9918. DOI: https://doi.org/10.2478/s12175-009-0122-7
About edition: