๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing fibonacci numbers quickly

โœ Scribed by Paul Cull; James L. Holloway

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
468 KB
Volume
32
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fibonacci numbers and words
Fibonacci numbers and words
โœ Giuseppe Pirillo ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 521 KB

Let 4> be the golden ratio (xf5 + 1)/2, f, the nth Fibonacci finite word and f the Fibonacci infinite word. Let r be a rational number greater than (2 + q~)/2 and u a non-empty word. If u" is a factor of f, then there exists n ~> 1 such that u is a conjugate of f. and, moreover, each occurrence of u

Incomplete Fibonacci and Lucas -numbers
Incomplete Fibonacci and Lucas -numbers
โœ Dursun Tasci; Mirac Cetin Firengiz ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 278 KB
Lagged Fibonacci Random Number Generator
Lagged Fibonacci Random Number Generators for Distributed Memory Parallel Computers
โœ Srinivas Aluru ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 192 KB

To parallelize applications that require the use of random numbers, an efficient and good quality parallel random number generator is required. In this paper, we study the parallelization of lagged Fibonacci generators for distributed memory parallel computers. Two popular ways of generating a rando