Article
Keywords:
sum of digits; recursive sequences; triple product identity; quintuple product; primality testing
Summary:
We examine the congruences and iterate the digit sums of integer sequences. We generate recursive number sequences from triple and quintuple product identities. And we use second order recursions to determine the primality of special number systems.
References:
[1] Bondarenko B.A.. :
Generalized Pascal Triangles and Pyramids: Their Fractals. Graphs, and Applications, pp. 36-37. Santa Clara, CA: The Fibonacci Association, 1993.
Zbl 0792.05001
[2] Ericksen L. :
“Golden Tuple Products.”. To Appear In Applications of Fibonacci Numbers 11, W. Webb (ed.), Dordrecht: Kluwer Academic Publishers, 2006.
MR 2463524
[3] Foata D., Han G.-N. :
“Jacobi and Watson Identities Combinatorially Revisited.”. From a Web Resource.
http://cartan.u-strasbg.fr/$\sim $gnonin/paper/pub81/html.
[5] Ribenboim P.:
“Primality Tests Based on Lucas Sequences.”. 2.V In The Little Book of Bigger Primes, 2nd ed. New York: Springer-Verlag, p. 63, 2004.
MR 2028675
[8] Vajda S. Fibonacci & Lucas Numbers, and the Golden Section:
Theory and Applications. pp. 177-178. Chichester: Ellis Horwood, 1989.
MR 1015938
[11] Wong C.K., Maddox T.W. :
“A Generalized Pascal’s Triangle.”. The Fibonacci Quarterly 13:2 (1975) 134-136.
MR 0360297