Infinite Range of Golden Ratios
Infinite PHI – ∞ φ


PHI series of numbers, 1st order: 1

Since this is a 1st order PHI, it has no further iterations. Once is all unity needs to authenticate itself.

It also has no relationship with any other value, so there is no need to approximate its solution by dividing some other number into unity!

Hence, all we get is... X = 1

Subtracting 1 from both sides, we get...
A linear polynomial in one unknown: X − 1 = 0




Continue with this brief overview, here...


      Name                      Last modified      Size  Description
Parent Directory - 2016/ 2016-06-29 17:17 - RSA Encryption/ 2016-07-02 17:50 - 8th_order_phi.php 2016-06-29 17:51 9.8K The Tally and Geometric Methods for discovering the eighth set of Golden Ratios. 8th_order_phi.txt 2016-06-29 17:51 9.8K This is the source code for generating the 8th order of PHI. gcd.js 2016-07-01 11:18 3.9K Source Code for the Expanded Euclidean Algorithm in JavaScript. gcd_exercise.gif 2016-06-26 06:22 108K Animated GIF demonstrates the GCD calculation of two integers – the simplest example. pell_ratio.jpg 2016-09-04 14:08 38K pgs_154_&_155_-_link.jpg 2016-09-08 15:39 150K phi.php 2016-06-29 14:25 23K The Tally and Geometric Methods for discovering an Infinite Range of Golden Ratios. phi.txt 2016-06-29 14:25 23K This is the source code for generating Infinite PHI. Check out these diagrams and tables of data... tablature_format-gcd.html 2016-06-29 15:18 23K The Expanded Euclidean Algorithm in JavaScript. tablature_format-gcd.php 2016-06-29 14:34 22K The Expanded Euclidean Algorithm in PHP. tablature_format-gcd.txt 2016-06-29 14:34 22K Source Code for the Expanded Euclidean Algorithm in PHP. Testy_Westy.html 2016-07-01 11:31 2.2K Test page which calls the JavaScript GCD function in gcd.js.

sTaTs