Download [Part 2]

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project

Document related concepts

Mathematics and art wikipedia, lookup

Infinity wikipedia, lookup

Collatz conjecture wikipedia, lookup

Arithmetic wikipedia, lookup

Patterns in nature wikipedia, lookup

Ratio wikipedia, lookup

Proofs of Fermat's little theorem wikipedia, lookup

Sequence wikipedia, lookup

Golden ratio wikipedia, lookup

List of works designed with the golden ratio wikipedia, lookup

Transcript
194
THE GOLDEN RATIO IN AN ELECTRICAL NETWORK
[Continued from page 188. ]
, r • rn
*AB
r + r
Apr. 1971
Since the network is infinite, we can disregard the addition of one s e c tion of each sequence. This allows to determine the resistance between points
A and B as equal to the resistance between C and D.
Consequently,
r • r
= r + —•
r
n
r + r
n
After solving this equation, we have *
rn = r • — ^ -
= r • 0
where </) is the Golden Ratio.
See also, S. L. Basin, "The Fibonacci Sequence as it Appears in N a t u r e , " Fibojna^cJ^u^rterij;, Vol. 1, No. 1, p. 53.
[Continued from page 187. ]
Editorial Note: The question remains how the students are to find the Fibonacci
or Lucas representation for the first factor. To find the Fibonacci representation for 28, we subtract the largest Fibonacci number not exceeding 28,
namely 21. This leaves 28 - 21 = 7y so our next choice is 5' 28 - 2 1 — 5
= 2, a Fibonacci number.
Thus, 28 = 21 + 5 + 2.
This will always yield
the representation with the least number of summands.
REFERENCES
1. V. E. Hoggatt, J r . , Fibonacci and Lucas Numbers,
Houghton-Mifflin
Company, Boston (1969), pp. 69-72.
2. John L. Brown, J r . , "Note on Complete Sequence of Integers," American
Mathematical Monthly, Vol. 67 (1960), pp. 557-560.