Number Systems
Background: Number Systems is a post to explore number systems in general and for use in the
physical and computational sciences.
Post 3
The Number One for Fibonacci n
F(n)
Post 2 has established:
1 𝐷 = (1 +
𝛾(∞)
𝑓{𝐷}
𝑇𝐷→(𝐷+𝛥2𝐷)
)
−1
(1 +
𝛾(𝐷+𝛥2𝐷)
𝑓{𝐷}
𝑇𝐷→(𝐷+𝛥2𝐷)
)
+1
1 𝐷 = (1 +
𝛾∞
𝑓
𝑇𝐷
)
−1
(1 +
𝛾 𝐷
𝑓
𝑇𝐷
)
+1
For natural events, this definition should correlate to the Bernoulli base of natural logarithms:
∫
1
𝑥
𝑑𝑥
𝑒
1
= 1 where lim
𝑛→∞
(1 +
1
𝑛
)
𝑛
= 𝑒
A mathematical description of nature should not be accurate unless the number system complies
with both natural conditions of the number one shown above.
𝐹 = {0, 1: 1, 2, 3, 5, 8, 13, 21, 34, 55, … }
To continue required mathematical rigor for natural events, we would need to define values of one that
apply to individual Fibonacci integers n in addition to the universal value of one = 1∞.
This is difficult nomenclature. An example of 1D for D = 3 where n also = 3, n3 = D = 3:
F = {0,1: 1, 2, 3, 5, 8, 13, 21, 34, 55, …}
1 𝐷 = (1 +
𝛾∞
𝑓
𝑇𝐷
)
−1
(1 +
𝛾 𝐷
𝑓
𝑇𝐷
)
+1
Where
D = 𝐹(3) = 3
ƒ = γ-1
{3} =
3
1
^
5
2
𝑇1→3 = (1 + 𝑅 𝐸
2
1⁄ 3
2⁄ 5
3⁄
)
𝑇1→8 = (1 + 𝑅 𝐸
2
1⁄ 3
2⁄ 5
3⁄ 8
5⁄ 13
8⁄
)
𝑇3→8 = 1 + 𝑅 𝐸
8
5⁄ 13
8⁄
As in Post 2
13 = (1 +
𝛾∞
𝑓
𝑇3→8
)
−1
(1 +
𝛾3
𝑓
𝑇3→8
)
+1
Then for F(n) = D = 3:
13 =0.999268
For example:
33 = [1(0.999268) + (1 +
𝛾∞
𝑓
𝑇3→8
)
−1
𝑥 (1 +
𝛾3
𝑓
𝑇3→8
)
+1
] 𝑥 3(0.999268)
33 = 2.99792
and so on for other integers where F(n) = D = 3.
Post 4 is intended to clarify nomenclature through additional examples of the Fibonacci
definition of one.

More Related Content

PDF
Post_Number Systems_2
PDF
Post_Number Systems_8.1.3
PPT
3.1 b solving systems graphically
PPT
Calc02 3 n
PPTX
Exponents Rules
PDF
Probabilistic approach to prime counting
PPTX
Power of Power Exponent Rule
PPTX
Statistical Method In Economics
Post_Number Systems_2
Post_Number Systems_8.1.3
3.1 b solving systems graphically
Calc02 3 n
Exponents Rules
Probabilistic approach to prime counting
Power of Power Exponent Rule
Statistical Method In Economics

What's hot (20)

PDF
Math scavenger hunt (secondary)
PDF
Math Scavenger Hunt (Secondary)
PPT
Natural Logs
PPTX
Merge sort
PPT
Common natural logarithms
PDF
Application of Differential Equation
PPT
Matlab on basic mathematics
PPTX
Integration ftw cyrus
PPT
3.1 (8th)
PPTX
statistics assignment help
PPTX
Statistical Physics Assignment Help
PPTX
Seismic data processing
ODP
Seismic data processing introductory lecture
PPTX
Iterativos Methods
PPTX
Statistics Assignment Help
PPT
A17-1 graphing systems
PPT
Solvesystembygraph
PDF
Finding The Volume of a Fishbowl By Integration.pdf
PPTX
Linear graph[1]edit
Math scavenger hunt (secondary)
Math Scavenger Hunt (Secondary)
Natural Logs
Merge sort
Common natural logarithms
Application of Differential Equation
Matlab on basic mathematics
Integration ftw cyrus
3.1 (8th)
statistics assignment help
Statistical Physics Assignment Help
Seismic data processing
Seismic data processing introductory lecture
Iterativos Methods
Statistics Assignment Help
A17-1 graphing systems
Solvesystembygraph
Finding The Volume of a Fishbowl By Integration.pdf
Linear graph[1]edit
Ad

Viewers also liked (8)

PDF
Post_Number Systems_4
PDF
Post_Number Systems_1
PDF
Satellite Infrared
PDF
Post_Number Systems_7
PDF
Post_Number Systems_8.1.11
PDF
Post_Number Systems_8.1.12
PDF
Post_Number Systems_8.3-3
PDF
Speed of Light
Post_Number Systems_4
Post_Number Systems_1
Satellite Infrared
Post_Number Systems_7
Post_Number Systems_8.1.11
Post_Number Systems_8.1.12
Post_Number Systems_8.3-3
Speed of Light
Ad

Similar to Post_Number Systems_3 (20)

PDF
Post_Number Systems_5
PDF
Post_Number Systems_6
PDF
Post_Number Systems_8.3
PDF
Post_Number Systems_8
PDF
Post_Number Systems_8.1.1
PDF
Post_Number Systems_8.1.2
PDF
Post_Number Systems_8.1
PDF
Post_Number Systems_8.2.1
PDF
Post_Number Systems_8.1.4
PDF
Post_Number Systems_8.2
PDF
Post_Number Systems_8.1.6
PPT
Per4 induction
PDF
MUMS: Bayesian, Fiducial, and Frequentist Conference - Objective Bayesian Ana...
PPTX
PDF
03_AJMS_170_19_RA.pdf
PDF
03_AJMS_170_19_RA.pdf
PDF
On the Application of the Fixed Point Theory to the Solution of Systems of Li...
PDF
Nonlinear perturbed difference equations
PDF
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
PPTX
recurence solutions
Post_Number Systems_5
Post_Number Systems_6
Post_Number Systems_8.3
Post_Number Systems_8
Post_Number Systems_8.1.1
Post_Number Systems_8.1.2
Post_Number Systems_8.1
Post_Number Systems_8.2.1
Post_Number Systems_8.1.4
Post_Number Systems_8.2
Post_Number Systems_8.1.6
Per4 induction
MUMS: Bayesian, Fiducial, and Frequentist Conference - Objective Bayesian Ana...
03_AJMS_170_19_RA.pdf
03_AJMS_170_19_RA.pdf
On the Application of the Fixed Point Theory to the Solution of Systems of Li...
Nonlinear perturbed difference equations
A Positive Integer 𝑵 Such That 𝒑𝒏 + 𝒑𝒏+𝟑 ~ 𝒑𝒏+𝟏 + 𝒑𝒏+𝟐 For All 𝒏 ≥ 𝑵
recurence solutions

More from Marc King (9)

PDF
Post_Number Systems_8.3.1
PDF
Post_Number Systems_8.1.12reduced
PDF
Post_Number Systems_8.1.7
PDF
Post_Number Systems_8.1.5
PDF
Chirp_Mass
PDF
Stonehenge
PDF
Stereoisomer
PDF
Fibonacci_Hubble
PDF
Time_Exercise
Post_Number Systems_8.3.1
Post_Number Systems_8.1.12reduced
Post_Number Systems_8.1.7
Post_Number Systems_8.1.5
Chirp_Mass
Stonehenge
Stereoisomer
Fibonacci_Hubble
Time_Exercise

Post_Number Systems_3

  • 1. Number Systems Background: Number Systems is a post to explore number systems in general and for use in the physical and computational sciences. Post 3 The Number One for Fibonacci n F(n) Post 2 has established: 1 𝐷 = (1 + 𝛾(∞) 𝑓{𝐷} 𝑇𝐷→(𝐷+𝛥2𝐷) ) −1 (1 + 𝛾(𝐷+𝛥2𝐷) 𝑓{𝐷} 𝑇𝐷→(𝐷+𝛥2𝐷) ) +1 1 𝐷 = (1 + 𝛾∞ 𝑓 𝑇𝐷 ) −1 (1 + 𝛾 𝐷 𝑓 𝑇𝐷 ) +1 For natural events, this definition should correlate to the Bernoulli base of natural logarithms: ∫ 1 𝑥 𝑑𝑥 𝑒 1 = 1 where lim 𝑛→∞ (1 + 1 𝑛 ) 𝑛 = 𝑒 A mathematical description of nature should not be accurate unless the number system complies with both natural conditions of the number one shown above. 𝐹 = {0, 1: 1, 2, 3, 5, 8, 13, 21, 34, 55, … } To continue required mathematical rigor for natural events, we would need to define values of one that apply to individual Fibonacci integers n in addition to the universal value of one = 1∞. This is difficult nomenclature. An example of 1D for D = 3 where n also = 3, n3 = D = 3: F = {0,1: 1, 2, 3, 5, 8, 13, 21, 34, 55, …} 1 𝐷 = (1 + 𝛾∞ 𝑓 𝑇𝐷 ) −1 (1 + 𝛾 𝐷 𝑓 𝑇𝐷 ) +1 Where D = 𝐹(3) = 3 ƒ = γ-1 {3} = 3 1 ^ 5 2 𝑇1→3 = (1 + 𝑅 𝐸 2 1⁄ 3 2⁄ 5 3⁄ )
  • 2. 𝑇1→8 = (1 + 𝑅 𝐸 2 1⁄ 3 2⁄ 5 3⁄ 8 5⁄ 13 8⁄ ) 𝑇3→8 = 1 + 𝑅 𝐸 8 5⁄ 13 8⁄ As in Post 2 13 = (1 + 𝛾∞ 𝑓 𝑇3→8 ) −1 (1 + 𝛾3 𝑓 𝑇3→8 ) +1 Then for F(n) = D = 3: 13 =0.999268 For example: 33 = [1(0.999268) + (1 + 𝛾∞ 𝑓 𝑇3→8 ) −1 𝑥 (1 + 𝛾3 𝑓 𝑇3→8 ) +1 ] 𝑥 3(0.999268) 33 = 2.99792 and so on for other integers where F(n) = D = 3. Post 4 is intended to clarify nomenclature through additional examples of the Fibonacci definition of one.