Buch, Englisch, 217 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 371 g
Volume 2
Buch, Englisch, 217 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 371 g
ISBN: 978-90-481-8447-7
Verlag: Springer Netherlands
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Mathematische Analysis Funktionalanalysis
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
- Mathematik | Informatik Mathematik Stochastik Mathematische Statistik
- Mathematik | Informatik Mathematik Algebra Zahlentheorie
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Datenanalyse, Datenverarbeitung
Weitere Infos & Material
Fermat-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.