|
|
|||
|
||||
OverviewFull Product DetailsAuthor: Andreas N. Philippou , Alwyn F. Horadam , G.E. BergumPublisher: Springer Imprint: Kluwer Academic Publishers Edition: 1988 ed. Dimensions: Width: 21.00cm , Height: 1.40cm , Length: 29.70cm Weight: 1.150kg ISBN: 9789027726735ISBN 10: 9027726736 Pages: 217 Publication Date: 30 April 1988 Audience: College/higher education , Professional and scholarly , Postgraduate, Research & Scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsFermat-Like Binomial Equations.- Recurrences Related to the Bessel Function.- Symmetric Recursive Sequences Mod M.- Primitive Divisors of Lucas Numbers.- A Congruence Relation for a Linear Recursive Sequence of Arbitrary Order.- Fibonacci Numbers and Groups.- A Triangular Array with Hexagon Property, Dual to Pascal’s Triangle.- Functions of the Kronecker Square of the Matrix Q.- Fibonacci Numbers of the Forms PX2 ± 1, PX3 ± 1, where P is Prime.- On the K-TH Order Linear Recurrence and Some Probability Applications.- On the Representation of Integral Sequences {Fn/d} and {Ln/d} as Sums of Fibonacci Numbers and as Sums of Lucas Numbers.- Primes Having an inComplete System of Residues for a Class of Second-Order Recurrences.- Covering the Integers with Linear Recurrences.- Recursive Theorems for Success Runs and Reliability of Consecutive-K-Out-of-N: F Systems.- Asveld’s Polynomials Pj(N).- More on the Problem of Diophantus.- On a Problem of Diophantus.- The Generalized Fibonacci Numbers {Cn}, Cn = Cn-1 + Cn-2 + K.- First Failures.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |