Supergolden ratio: Difference between revisions
m →Supergolden rectangle: Theorem of the gnomon. |
Report bugs. | Suggested by Dominic3203 | Category:Golden ratio | #UCB_Category 19/25 |
||
Line 123: | Line 123: | ||
:<math> N_{n} = \sum_{k=0}^{\lfloor n / 3 \rfloor}{n-2k \choose k}</math>. |
:<math> N_{n} = \sum_{k=0}^{\lfloor n / 3 \rfloor}{n-2k \choose k}</math>. |
||
The [[Characteristic equation (calculus)|characteristic equation]] of the recurrence is <math>x^{3}-x^{2}-1=0</math>. If the three solutions are real root {{tmath|\alpha}} and conjugate pair {{tmath|\beta}} and {{tmath|\gamma}}, the Narayana numbers can be computed with the [[Fibonacci sequence#Binet's formula|Binet formula]] <ref>{{Cite journal |last=Lin |first=Xin| date=2021 |title=On the recurrence properties of Narayana's cows sequence |journal=[[Symmetry (journal)|Symmetry]] |volume=13 |issue=149 | |
The [[Characteristic equation (calculus)|characteristic equation]] of the recurrence is <math>x^{3}-x^{2}-1=0</math>. If the three solutions are real root {{tmath|\alpha}} and conjugate pair {{tmath|\beta}} and {{tmath|\gamma}}, the Narayana numbers can be computed with the [[Fibonacci sequence#Binet's formula|Binet formula]] <ref>{{Cite journal |last=Lin |first=Xin| date=2021 |title=On the recurrence properties of Narayana's cows sequence |journal=[[Symmetry (journal)|Symmetry]] |volume=13 |issue=149 |page=149 |doi=10.3390/sym13010149 |doi-access=free |bibcode=2021Symm...13..149L |language=en}}</ref> |
||
:<math> N_{n-2} =a \alpha^{n} +b \beta^{n} +c \gamma^{n} </math>, with real {{tmath|a}} and conjugates {{tmath|b}} and {{tmath|c}} the roots of <math> 31x^{3} +x -1 = 0 </math>. |
:<math> N_{n-2} =a \alpha^{n} +b \beta^{n} +c \gamma^{n} </math>, with real {{tmath|a}} and conjugates {{tmath|b}} and {{tmath|c}} the roots of <math> 31x^{3} +x -1 = 0 </math>. |
||
Since <math> \left\vert b \beta^{n} +c \gamma^{n} \right\vert < 1 /\alpha^{n/2} </math> and <math> \alpha = \psi </math>, the number {{tmath|N_{n} }} is the nearest integer to <math> a\,\psi^{n+2} </math>, with {{math|''n'' ≥ 0}} and <math> a =\psi /( \psi^{2} +3) =</math> {{gaps|0.28469|30799|75318|50274|74714...}} |
Since <math> \left\vert b \beta^{n} +c \gamma^{n} \right\vert < 1 /\alpha^{n/2} </math> and <math> \alpha = \psi </math>, the number {{tmath|N_{n} }} is the nearest integer to <math> a\,\psi^{n+2} </math>, with {{math|''n'' ≥ 0}} and <math> a =\psi /( \psi^{2} +3) =</math> {{gaps|0.28469|30799|75318|50274|74714...}} |
Revision as of 13:15, 23 February 2025
In mathematics, the supergolden ratio is a geometrical
The name supergolden ratio results from analogy with the golden ratio, the positive solution of the equation x2 = x + 1.

Definition
Two quantities a > b > 0 are in the supergolden ratio-squared if The ratio is commonly denoted
Based on this definition, one has
It follows that the supergolden ratio is found as the unique real solution of the cubic equation The decimal expansion of the root begins as (sequence A092526 in the OEIS).
The minimal polynomial for the reciprocal root is the depressed cubic ,[2] thus the simplest solution with Cardano's formula, or, using the hyperbolic sine,
is the superstable fixed point of the iteration .
The iteration results in the continued radical
Dividing the defining trinomial by one obtains , and the conjugate elements of are with and
Properties

Many properties of are related to golden ratio . For example, the supergolden ratio can be expressed in terms of itself as the infinite geometric series [4]
- and
in comparison to the golden ratio identity
- and vice versa.
Additionally, , while
For every integer one has From this an infinite number of further relations can be found.
Argument satisfies the identity [5]
Continued fraction pattern of a few low powers
Notably, the continued fraction of begins as permutation of the first six natural numbers; the next term is equal to their sum + 1.
The supergolden ratio is the fourth smallest
The minimal polynomial of the supergolden ratio has discriminant . The Hilbert class field of imaginary quadratic field can be formed by adjoining . With argument a generator for the ring of integers of , one has the special value of Dedekind eta quotient
- .
Expressed in terms of the Weber-Ramanujan class invariant Gn
Properties of the related Klein j-invariant result in near identity . The difference is < 1/143092.
The elliptic integral singular value[7] for has closed form expression
(which is less than 1/10 the eccentricity of the orbit of Venus).
Narayana sequence
![]() |
![]() |
Narayana's cows is a recurrence sequence originating from a problem proposed by the 14th century Indian mathematician Narayana Pandita.[8] He asked for the number of cows and calves in a herd after 20 years, beginning with one cow in the first year, where each cow gives birth to one calf each year from the age of three onwards.
The Narayana sequence has a close connection to the Fibonacci and Padovan sequences and plays an important role in data coding, cryptography and combinatorics. The number of compositions of n into parts 1 and 3 is counted by the nth Narayana number.
The Narayana sequence is defined by the third-order recurrence relation with initial values
The first few terms are 1, 1, 1, 2, 3, 4, 6, 9, 13, 19, 28, 41, 60, 88,... (sequence A000930 in the OEIS). The limit ratio between consecutive terms is the supergolden ratio.
The first 11 indices n for which is prime are n = 3, 4, 8, 9, 11, 16, 21, 25, 81, 6241, 25747 (sequence A170954 in the OEIS). The last number has 4274 decimal digits.
The sequence can be extended to negative indices using
The generating function of the Narayana sequence is given by
The Narayana numbers are related to sums of binomial coefficients by
- .
The characteristic equation of the recurrence is . If the three solutions are real root and conjugate pair and , the Narayana numbers can be computed with the Binet formula [9]
- , with real and conjugates and the roots of .
Since and , the number is the nearest integer to , with n ≥ 0 and 0.2846930799753185027474714...
Coefficients result in the Binet formula for the related sequence .
The first few terms are 3, 1, 1, 4, 5, 6, 10, 15, 21, 31, 46, 67, 98, 144,... (sequence A001609 in the OEIS).
This anonymous sequence has the Fermat property: if p is prime, . The converse does not hold, but the small number of odd pseudoprimes makes the sequence special.[10] The 8 odd composite numbers below 108 to pass the test are n = 1155, 552599, 2722611, 4822081, 10479787, 10620331, 16910355, 66342673.

The Narayana numbers are obtained as integral powers n > 3 of a matrix with real eigenvalue [8]
The trace of gives the above .
Alternatively, can be interpreted as incidence matrix for a D0L Lindenmayer system on the alphabet with corresponding substitution rule and initiator . The series of words produced by iterating the substitution have the property that the number of c's, b's and a's are equal to successive Narayana numbers. The lengths of these words are
Associated to this string rewriting process is a compact set composed of self-similar tiles called the Rauzy fractal, that visualizes the combinatorial information contained in a multiple-generation three-letter sequence.[11]
Supergolden rectangle

A supergolden rectangle is a rectangle whose side lengths are in a ratio. Compared to the golden rectangle, the supergolden rectangle has one more degree of self-similarity.
Given a rectangle of height 1, length and diagonal length (according to ). The triangles on the diagonal have altitudes each perpendicular foot divides the diagonal in ratio .
On the left-hand side, cut off a square of side length 1 and mark the intersection with the falling diagonal. The remaining rectangle now has aspect ratio (according to ). Divide the original rectangle into four parts by a second, horizontal cut passing through the intersection point.[12][4]
The rectangle below the diagonal has aspect ratio , the other three are all supergolden rectangles, with a fourth one between the feet of the altitudes. The parent rectangle and the four scaled copies have linear sizes in the ratios It follows from the theorem of the gnomon that the areas of the two rectangles opposite the diagonal are equal.
In the supergolden rectangle above the diagonal, the process is repeated at a scale of .
Supergolden spiral

A supergolden spiral is a logarithmic spiral that gets wider by a factor of for every quarter turn. It is described by the
See also
- Solutions of equations similar to :
- Golden ratio – the only positive solution of the equation
- Plastic ratio – the only real solution of the equation
- Supersilver ratio – the only real solution of the equation
Notes
- ^ German Wikipedia has a table of analytical values of the Ramanujan G-function for odd arguments below 47.
References
- ^ Sloane, N. J. A. (ed.). "Sequence A092526". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ (sequence A263719 in the OEIS)
- ^ m/n√x = xn/m
- ^ ISBN 978-0-471-39969-8.
- ^ Piezas III, Tito (Dec 18, 2022). "On the tribonacci constant with cos(2πk/11), plastic constant with cos(2πk/23), and others". Mathematics stack exchange. Retrieved June 11, 2024.
- ^ (sequence A092526 in the OEIS)
- ^ Weisstein, Eric W. "Elliptic integral singular value". MathWorld.
- ^ a b (sequence A000930 in the OEIS)
- .
- JSTOR 2007637.
- .
- S2CID 125782726.