On the Periods of Generalized Fibonacci Recurrences
From MaRDI portal
Publication:4305958
DOI10.2307/2153583zbMath0809.11083arXiv1004.5439OpenAlexW2147317602WikidataQ56457051 ScholiaQ56457051MaRDI QIDQ4305958
Publication date: 15 September 1994
Full work available at URL: https://arxiv.org/abs/1004.5439
pseudorandom number generationgeneralized Fibonacci sequencemaximal periodirreducible trinomialperiodic linear recurrence
Polynomials in general fields (irreducibility, etc.) (12E05) Random number generation in numerical analysis (65C10) Sequences (mod (m)) (11B50) Calculation of integer sequences (11Y55)
Related Items (9)
Unnamed Item ⋮ Repdigit Keith numbers ⋮ A search for good pseudo-random number generators: survey and empirical studies ⋮ Repdigits in \(k\)-Lucas sequences ⋮ Participating life insurance policies: an accurate and efficient parallel software for COTS clusters ⋮ On parallel asset-liability management in life insurance: a forward risk-neutral approach ⋮ Repdigits as sums of two \(k\)-Fibonacci numbers ⋮ When lagged Fibonacci generators jump ⋮ On a generalization of the Pell sequence
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrices and the structure of random number sequences
- A review of pseudorandom number generators
- On computing reciprocals of power series
- On Hensel factorization. I
- Primitive t-Nomials (t = 3, 5) Over GF(2) Whose Degree is a Mersenne Exponent 44497
- Empirical Tests of an Additive Random Number Generator
- Primitive Polynomials (Mod 2)
- Random Number Generators on Vector Supercomputers and Other Advanced Architectures
- Primitive Binary Polynomials
- The Arithmetical Theory of Linear Recurring Series
- Random Numbers Generated by Linear Recurrence Modulo Two
- On primitive trinomials (Mod 2)
- Primitive Trinomials of High Degree
- Primitive trinomials whose degree is a Mersenne exponent
- On xn + x + 1 over GF(2)
This page was built for publication: On the Periods of Generalized Fibonacci Recurrences
