Applications of Fibonacci Numbers, Volume 7
Kluwer Academic, 1998 - Mathematics - 484 pages
This volume contains the proceedings of the Seventh International Research Conference on Fibonacci Numbers and their Applications. It includes a carefully refereed collection of papers dealing with number patterns, linear recurrences and the application of the Fibonacci Numbers to probability, statistics, differential equations, cryptography, computer science and elementary number theory. This volume provides a platform for recent discoveries and encourages further research. It is a continuation of the work presented in the previously published proceedings of the earlier conferences, and shows the growing interest in, and importance of, the pure and applied aspects of Fibonacci Numbers in many different areas of science. Audience: This book will be of interest to those whose work involves number theory, statistics and probability, algebra, numerical analysis, group theory and generalisations.
29 pages matching positive integer in this book
Results 1-3 of 29
What people are saying - Write a review
We haven't found any reviews in the usual places.
THE FIBONACCI SHUFFLE TREE
GENERALIZATIONS TO LARGE HEXAGONS OF THE STAR OF DAVID THEOREM
A NOTE ON A REPRESENTATION CONJECTURE BY HOGGATT
24 other sections not shown
1998 Kluwer Academic A.F. Horadam A.N. Philippou algebraic algorithm AMS Classification Numbers Applications of Fibonacci Bergum Bernoulli Polynomials binary tree binomial coefficients cells Cn(x coauthor column combinatorial Computer consider continued fraction Corollary defined denote derived sequence diophantine equation Diophantine quadruples Diophantus distribution of order divisor Edited by G.E. elements example F-code factors Fibonacci and Lucas Fibonacci Numbers Fibonacci Quarterly Fibonacci sequence Fibonacci tree Fibonacci vector Fibonacci-type polynomials finite follows formula function G. E. Bergum given Golden Section Hence hexagon Hoggatt identity infinite interval irreducible Kluwer Academic Publishers l(mod lattice Lemma linear recurring sequence Lucas numbers Lucas sequences Math Mathematics modulo multiplication Netherlands Newton polygon node notation number fields Number Theory obtain Pascal's triangle Pell numbers positive integer probable prime Proof Proposition proved pseudoprimes recurrence sequences respectively roots rule solution symmetric Theorem 3.2 values zero