Linear recursive sequences and factorials
| dc.contributor.advisor | Liptai, Kálmán | |
| dc.contributor.author | Szakács, Tamás | |
| dc.contributor.department | Matematika- és számítástudományok doktori iskola | hu |
| dc.contributor.submitterdep | Természettudományi és Technológiai Kar::Matematikai Intézet::Algebra és Számelmélet Tanszék | |
| dc.date.accessioned | 2024-11-11T09:24:07Z | |
| dc.date.available | 2024-11-11T09:24:07Z | |
| dc.date.created | 2024 | |
| dc.date.defended | 2024-10-01 | |
| dc.description.abstract | In the second chapter of this work, when discussing linear recursive sequences, many results can be read about Fibonacci numbers. We discuss theorems about recursive sequences, where the quotient of adjacent terms of the sequences approaches the golden ratio. Later, integer sequences are constructed as linear combinations of Fibonacci numbers and rational polynomials. In the last part of the chapter, we deal with the convolution of second order linear recursive sequences, where Fibonacci numbers and other famous sequences also appear. In the third chapter, we discuss the question of finding all products of factorials yielding a factorial, which is a long standing problem, studied by many authors. | |
| dc.format.extent | 74 oldal | |
| dc.identifier.uri | https://hdl.handle.net/2437/381856 | |
| dc.language.iso | en | |
| dc.subject | Recursive sequence, factorials, convolution, golden ratio, Fibonacci; rekurzív sorozatok, faktoriálisok, konvolúció, aranyarány, Fibonacci | |
| dc.subject.discipline | Matematika- és számítástudományok | hu |
| dc.subject.sciencefield | Természettudományok | hu |
| dc.title | Linear recursive sequences and factorials | |
| dc.title.translated | Lineáris rekurzív sorozatok és faktoriálisok |
Fájlok
Engedélyek köteg
1 - 1 (Összesen 1)
Nincs kép
- Név:
- license.txt
- Méret:
- 1.93 KB
- Formátum:
- Item-specific license agreed upon to submission
- Leírás: