international journal of computer science and applications.pdfVIP

International Journal of Computer Science and Applications c Technomathematics Research Foundation Vol. 7 No. 4, pp. 1 - 15, 2010 A Note On the Bounds for the Generalized Fibonacci-p-Sequence and its Application in Data-Hiding Sandipan Dey Microsoft India Development Center sandipan.dey@ Hameed Al-Qaheri Department of Quantitative Methods and Information Systems College of Business Administration Kuwait University alqaheri@.kw Suneeta Sane Computer and Information Technology Department Veermata Jijabai Technological Institute Mumbai, Maharashtra 400019, India sssane@.in Sugata Sanyal School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road, Mumbai - 400005, India sanyal@tifr.res.in In this paper, we suggest a lower and an upper bound for the Generalized Fibonacci- p-Sequence, for different values of p . The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two consecutive terms in generalized Fibonacci sequence converges to a p-degree polynomial and then use this re- sult to prove the bounds for generalized Fibonacci-p sequence, thereby generalizing the exponential bounds for cla