Longest Circular Runs with an Application in Reliability Via the Fibonacci-Type Polynomials of Order K

Andreas N. Philippou and Frosso S. Makri
Additional contact information
Andreas N. Philippou: Ministry of Education

A chapter in Applications of Fibonacci Numbers, 1990, pp 281-286 from Springer

Abstract: Abstract Unless otherwise stated, in this paper k and n are possitive integers, n j (1≤j≤k+1) are non-negative integers as specified, p and x are real numbers in the intervals (0,1) and (0,∞), respectively, and q=1 − p.

Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-009-1910-5_31

Ordering information: This item can be ordered from
http://www.springer.com/9789400919105

DOI: 10.1007/978-94-009-1910-5_31

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().