Number Systems
Background: Numbers Systems is a post to explore number systems in general and for use in the
physical and computational sciences.
Post 2
The Number One for Fibonacci n
F(n)
Post 1 has established:
1 =
[
1 +
2
5
3
1
5
2
8
3
13
5
21
8 . . . ^
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.
Then to be rigorous, we need to write:
1 = 1∞
For the infinite limit defining 1:
1 = 1∞ = 𝜙 + 𝛾
The Fibonacci definition of infinite ratios:
ϕ = lim
𝑛→ ∞
𝐹 𝑛−1
𝐹 𝑛
𝛾 = lim
𝑛→ ∞
𝐹 𝑛−2
𝐹 𝑛
𝐹(𝑛) = 𝐹(𝑛 − 2) + 𝐹(𝑛 − 1)
with seed values 0 and 1
𝐹 = {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∞.
For integers defining F(n) as above, to define 1n, we need to interpolate from the infinite definition of one.
To be rigorous, we need to state the following nomenclature and mathematics:
1 = 1∞
1 𝑛 = 𝜙 𝑛 + 𝛾𝑛
Define
𝐷 = 𝐹(𝑛)
𝜙 𝐷 =
𝐷
𝐷 + 𝛥1𝐷
𝛾 𝐷 =
𝐷 − 𝛥1𝐷
𝐷 + 𝛥1𝐷
1 𝐷 = 𝜙 𝐷 + 𝛾 𝐷
𝑓{𝐷} = γ-1
{D}
γ-1
{D} =
3
1
^
5
2
^
8
3
^
(𝐷+𝛥1𝐷)
(𝐷−𝛥1𝐷)
𝑅 𝐸 = [(𝛾−1)^(𝛾−1)]−1
𝑇1→𝐷 = (1 + 𝑅 𝐸
2
1⁄ 3
2⁄ 5
3⁄ 8
5⁄ 13
8⁄ 21
13⁄ 34
21⁄ …
(𝐷+𝛥1𝐷)
𝐷⁄
)
Then
1 𝐷 = (1 +
𝛾(∞)
𝑓{𝐷}
𝑇𝐷→(𝐷+𝛥2𝐷)
)
−1
(1 +
𝛾(𝐷+𝛥2𝐷)
𝑓{𝐷}
𝑇𝐷→(𝐷+𝛥2𝐷)
)
+1
A more concise form:
1 𝐷 = (1 +
𝛾∞
𝑓
𝑇𝐷
)
−1
(1 +
𝛾 𝐷
𝑓
𝑇𝐷
)
+1
This is difficult nomenclature. Post 3 is intended to clarify nomenclature through examples of the
Fibonacci definition of one.

More Related Content

PDF
Post_Number Systems_3
PPT
Mathematical induction
PPTX
Mathematical induction
PPTX
5.4 mathematical induction t
PPTX
Principle of mathematical induction
PPT
Per4 induction
Post_Number Systems_3
Mathematical induction
Mathematical induction
5.4 mathematical induction t
Principle of mathematical induction
Per4 induction

What's hot (20)

PDF
New formula for Euler product formula not equal to Riemann zeta function
PPTX
properties of addition and subtraction of integers
PDF
Math induction principle (slides)
PPT
5.2 Strong Induction
PPTX
PPTX
CMSC 56 | Lecture 11: Mathematical Induction
PPTX
Mathematical Induction
PPTX
Mathematical induction and divisibility rules
PPT
Solvesystembygraph
PPTX
5.4 mathematical induction
PPT
5.1 Induction
PPTX
Sequences
PDF
Time_Exercise
PPTX
Algebraic Properties of Matrix Operations
PDF
Mathematical induction by Animesh Sarkar
DOCX
Number system
PPTX
Properties of Real Numbers and Equality - Mathematics 8 (3rd Quarter)
PPTX
002#pedagogy math test
PAGES
Algebra 1
PPTX
Properties of equality and Proving
New formula for Euler product formula not equal to Riemann zeta function
properties of addition and subtraction of integers
Math induction principle (slides)
5.2 Strong Induction
CMSC 56 | Lecture 11: Mathematical Induction
Mathematical Induction
Mathematical induction and divisibility rules
Solvesystembygraph
5.4 mathematical induction
5.1 Induction
Sequences
Time_Exercise
Algebraic Properties of Matrix Operations
Mathematical induction by Animesh Sarkar
Number system
Properties of Real Numbers and Equality - Mathematics 8 (3rd Quarter)
002#pedagogy math test
Algebra 1
Properties of equality and Proving
Ad

Similar to Post_Number Systems_2 (20)

PDF
Post_Number Systems_4
PDF
Post_Number Systems_1
PDF
Post_Number Systems_5
PDF
Post_Number Systems_6
PDF
Post_Number Systems_8
PDF
Post_Number Systems_7
PPT
Fibonacci
PDF
Post_Number Systems_8.3
PDF
Post_Number Systems_8.3-3
PDF
Post_Number Systems_8.2
PDF
Sands807
PDF
Fi̇bonacci̇ sequence
PDF
Post_Number Systems_8.2.1
PDF
Mth3101 Advanced Calculus Chapter 3
DOC
Review of series
PDF
Mathematics Student G9_2.pdf
PDF
Lesson1
PDF
Introduction to Calculus 1
PDF
9 th math
DOCX
LA CRIBA DE FIBONACCI PARA NÚMEROS PRIMOS
Post_Number Systems_4
Post_Number Systems_1
Post_Number Systems_5
Post_Number Systems_6
Post_Number Systems_8
Post_Number Systems_7
Fibonacci
Post_Number Systems_8.3
Post_Number Systems_8.3-3
Post_Number Systems_8.2
Sands807
Fi̇bonacci̇ sequence
Post_Number Systems_8.2.1
Mth3101 Advanced Calculus Chapter 3
Review of series
Mathematics Student G9_2.pdf
Lesson1
Introduction to Calculus 1
9 th math
LA CRIBA DE FIBONACCI PARA NÚMEROS PRIMOS
Ad

More from Marc King (18)

PDF
Post_Number Systems_8.3.1
PDF
Post_Number Systems_8.1.12reduced
PDF
Satellite Infrared
PDF
Post_Number Systems_8.1.12
PDF
Post_Number Systems_8.1.11
PDF
Post_Number Systems_8.1.7
PDF
Post_Number Systems_8.1.6
PDF
Post_Number Systems_8.1.5
PDF
Post_Number Systems_8.1.4
PDF
Post_Number Systems_8.1.3
PDF
Post_Number Systems_8.1.2
PDF
Post_Number Systems_8.1.1
PDF
Post_Number Systems_8.1
PDF
Speed of Light
PDF
Chirp_Mass
PDF
Stonehenge
PDF
Stereoisomer
PDF
Fibonacci_Hubble
Post_Number Systems_8.3.1
Post_Number Systems_8.1.12reduced
Satellite Infrared
Post_Number Systems_8.1.12
Post_Number Systems_8.1.11
Post_Number Systems_8.1.7
Post_Number Systems_8.1.6
Post_Number Systems_8.1.5
Post_Number Systems_8.1.4
Post_Number Systems_8.1.3
Post_Number Systems_8.1.2
Post_Number Systems_8.1.1
Post_Number Systems_8.1
Speed of Light
Chirp_Mass
Stonehenge
Stereoisomer
Fibonacci_Hubble

Post_Number Systems_2

  • 1. Number Systems Background: Numbers Systems is a post to explore number systems in general and for use in the physical and computational sciences. Post 2 The Number One for Fibonacci n F(n) Post 1 has established: 1 = [ 1 + 2 5 3 1 5 2 8 3 13 5 21 8 . . . ^ 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. Then to be rigorous, we need to write: 1 = 1∞ For the infinite limit defining 1: 1 = 1∞ = 𝜙 + 𝛾 The Fibonacci definition of infinite ratios: ϕ = lim 𝑛→ ∞ 𝐹 𝑛−1 𝐹 𝑛 𝛾 = lim 𝑛→ ∞ 𝐹 𝑛−2 𝐹 𝑛 𝐹(𝑛) = 𝐹(𝑛 − 2) + 𝐹(𝑛 − 1) with seed values 0 and 1 𝐹 = {0, 1: 1, 2, 3, 5, 8, 13, 21, 34, 55, … }
  • 2. 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∞. For integers defining F(n) as above, to define 1n, we need to interpolate from the infinite definition of one. To be rigorous, we need to state the following nomenclature and mathematics: 1 = 1∞ 1 𝑛 = 𝜙 𝑛 + 𝛾𝑛 Define 𝐷 = 𝐹(𝑛) 𝜙 𝐷 = 𝐷 𝐷 + 𝛥1𝐷 𝛾 𝐷 = 𝐷 − 𝛥1𝐷 𝐷 + 𝛥1𝐷 1 𝐷 = 𝜙 𝐷 + 𝛾 𝐷 𝑓{𝐷} = γ-1 {D} γ-1 {D} = 3 1 ^ 5 2 ^ 8 3 ^ (𝐷+𝛥1𝐷) (𝐷−𝛥1𝐷) 𝑅 𝐸 = [(𝛾−1)^(𝛾−1)]−1 𝑇1→𝐷 = (1 + 𝑅 𝐸 2 1⁄ 3 2⁄ 5 3⁄ 8 5⁄ 13 8⁄ 21 13⁄ 34 21⁄ … (𝐷+𝛥1𝐷) 𝐷⁄ ) Then 1 𝐷 = (1 + 𝛾(∞) 𝑓{𝐷} 𝑇𝐷→(𝐷+𝛥2𝐷) ) −1 (1 + 𝛾(𝐷+𝛥2𝐷) 𝑓{𝐷} 𝑇𝐷→(𝐷+𝛥2𝐷) ) +1 A more concise form: 1 𝐷 = (1 + 𝛾∞ 𝑓 𝑇𝐷 ) −1 (1 + 𝛾 𝐷 𝑓 𝑇𝐷 ) +1 This is difficult nomenclature. Post 3 is intended to clarify nomenclature through examples of the Fibonacci definition of one.