A symmetric algorithm for golden ratio in hyper-Horadam numbers (Q523587): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: We study some ratios related to hyper-Horadam numbers such as \(W_n^{\left(r\right)} / W_{n - 1}^{\left(r\right)}\) while \(n \to \infty\) by using a symmetric algorithm obtained by the recurrence relation \(a_n^k = a_n^{k - 1} + a_{n - 1}^k\), where \(W_n^{\left(r\right)}\) is the \(n\)th hyper-Horadam number. Also, we give some special cases of these ratios such as the golden ratio and silver ratio. | |||
Property / review text: Summary: We study some ratios related to hyper-Horadam numbers such as \(W_n^{\left(r\right)} / W_{n - 1}^{\left(r\right)}\) while \(n \to \infty\) by using a symmetric algorithm obtained by the recurrence relation \(a_n^k = a_n^{k - 1} + a_{n - 1}^k\), where \(W_n^{\left(r\right)}\) is the \(n\)th hyper-Horadam number. Also, we give some special cases of these ratios such as the golden ratio and silver ratio. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 11B39 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6707022 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hyper-Horadam numbers | |||
Property / zbMATH Keywords: hyper-Horadam numbers / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
golden ratio | |||
Property / zbMATH Keywords: golden ratio / rank | |||
Normal rank |
Revision as of 06:01, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A symmetric algorithm for golden ratio in hyper-Horadam numbers |
scientific article |
Statements
A symmetric algorithm for golden ratio in hyper-Horadam numbers (English)
0 references
21 April 2017
0 references
Summary: We study some ratios related to hyper-Horadam numbers such as \(W_n^{\left(r\right)} / W_{n - 1}^{\left(r\right)}\) while \(n \to \infty\) by using a symmetric algorithm obtained by the recurrence relation \(a_n^k = a_n^{k - 1} + a_{n - 1}^k\), where \(W_n^{\left(r\right)}\) is the \(n\)th hyper-Horadam number. Also, we give some special cases of these ratios such as the golden ratio and silver ratio.
0 references
hyper-Horadam numbers
0 references
golden ratio
0 references