Question
Asked 22nd Feb, 2018
The relationship between prime numbers and Fibonacci numbers (Part 2) ?
In May 2017, I posted my first research regarding to the relationship between prime number and Fibonacci number
https://www.linkedin.com/pulse/relationships-between-prime-number-fibonacci-thinh-nghiem/
I have chance to go further in this subject. In detail, I realized that a prime number can be analyzed into sum of many Fibonacci numbers. Below are some examples:
29 = 21 + 3 + 5
107 = 89 + 13 + 5
1223 = 987 + 233 + 3
I have successfully analyzed the first 1,000 prime numbers with above methodology. Calculation can be found in
https://docs.google.com/spreadsheets/d/1sGmyr9dZwLhfFWcSgwviwm2X838h0CQF4KWRqX_eXkA/edit#gid=685523897
I have tried unsuccessfully to limit the series up to only 3 Fibonacci numbers. As you see in my shared worksheet, some prime numbers are calculated to 6 or even 7 Fibonacci numbers. I expect that in next research, a simpler formula between these types of numbers can be discovered.
All feedback is welcome.
Regards,
Thinh Nghiem
Most recent answer
@ Thinh Nghiem
Sorry, as fare as I know there is no link to that `article´ because it is a chapter of a book.
The ISBN of that book (in German!):
ISBN 3—9802808—2—9
All Answers (10)
Lublin University of Technology
Interesting. Do you consider any practical application or your results are just a part of "pure" number theory?
1 Recommendation
Lebanese International University
Dear Thin,
Nice observation.
In fact, one can prove the following general result:
Theorem: If n > 1, then n equals a finite sum of Fibonacci numbers.
The proof is simple:
If n is a Fibonacci number, there is nothing to proof
n = Fm = Fm-1 +Fm-2
( by the recurrence of Fibonacci)
If not, choose the closest Fibonacci Fm to n,
that is, n = Fm + n1.
Now if n1 is Fibonacci number , done.
n = Fibonacci + Fibonacci.
If not, proceed the same for n1. choose the closest Fibonacci Fk to n1
n1 = Fk + n2 ,then n = Fm + n1 = Fm + Fk + n2
Keep on the same procedure for n2 in decreasing order to reach the smallest Fibonacci in the sequel and the proof is complete.
Example 1. n = 354 224848179 261915096
The closest Fibonacci number to n is F100 = 354 224848179 261915075
n = F100+ 21
the closest Fibonacci number to 21 is F7 = 13
then n = F100+ 21 = F100+ F7 + 8 = F100+ F7 + F6 .
One May investigate the problem:
What is the smallest sum of Fibonacci numbers that represent a given positive integer n?
Best wishes
2 Recommendations
Seneca College
@ Przemysław Kowalik
To say honestly, I am doing my research relating to this subject in my free time just for relax. I love mathematics from my childhood. I am not sure if this research can have any practical application. If you think any area can use it (security nerwork, cryptography etc.) please recommend it. thank you
1 Recommendation
Seneca College
@ Issam Kaddoura
The problem is when we repeat our procedure to all possible Fibonacci numbers, we are not sure the final Fk is Fobonacci or not.
What is the smallest sum of Fibonacci numbers that represent a given positive integer n?
You are right. In part 2, I just analyzed prime number into sum of many Fibonacci numbers. In part 3, I will limit to the smallest sum as much as possible
1 Recommendation
Lebanese International University
@ Thinh,
Yes, Fk is a Fibonacci number. It is the closest one to n1 .
(check by example) .The algorithm works.
It is simple to observe [any number has a closest Fibonacci number.]
A good problem is:
Given any positive integer n. What is the minimum number of Fibonacci numbers needed such that n equals their sum?
P.S n needs not prime integer.
Best
1 Recommendation
Vinnytsia National Technical University
If you find the rule for generating rather large prime numbers (i.e. at range near 2^160 or greater) it would aid asymmetric cryptography (for primitives construction based on the discrete logarithm problem and/or elliptic curves).
Can suggest looking through papers related to Fibonacci numbers by Volodymyr Luzhetskyi and/or Alexey Stakhov.
1 Recommendation
@ Thinh Nghiem
The code of Fibonacci numbers by prime numbers first (as I know) was revealed (shown) by Plichta in 1998 (see: Peter Plichta, Das Primzahlkreuz, Band III, Die 4 Pole der Ewigkeit; page 188 ff.).
Your paper may be new or an expandation; I won’t test it.
But if you are looking for t h e application, Plichta gave it.
There is a relationship between the prime coded fibonacci numbers and the rule of the plan for atomic materials (see at the same place as above named).
In deeply recognition to Peter Plichta, best regards, Peter Kepp
Similar questions and discussions
Is there is any instant iterative formula to calculate non-trivial zeros of Riemann zeta function ?
Compute nontrivial zeros of Riemann zeta function is an algebraically complex task. However, if someone able to prove such an iterative formula can be used to get all approximate nontrivial using an iterative formula, then its value is limitless.How ever to prove such an iterative formula is kind of a huge challenge. If somebody can proved such a formula what kind of impact will produce to Riemann hypothesis? . Also accuracy of approximately calculated non trivial accept as close calculation to non trivial zeros ?
Here I have been calculated and attached first 50 of approximate nontrivial using an iterative such formula that I have been proved. Also it is also can be produce millions of none trivial zeros. But I am very much voirie about its appearance of its accuracy !!. Are these calculations Is ok?
The relationships between Prime number and Fibonacci number ?
Dears,
Recently when learning programming language, I accidentally found out an interesting relationship between prime number and Fibonacci number.
That is, a positive integer number can be analyzed as either
- the sum of a prime number and a Fibonacci number
For example
16 = 11 (prime) + 5 (Fibonnaci)
61 = 59 (prime) + 2 (Fibonacci)
- or a prime number minus a Fibonacci number
For example
59 = 61 (prime) – 2 (Fibonacci)
83 = 227 (prime) – 144 (Fibonacci)
I have tried with the first 1,000 positive integer number from 1 to 1,000 MANUALLY and ensured that all of them matched with one of the two above rules.
I shared my analyzing here in the excel file with 1,000 positive integer number from 1 to 1,000 with the link
The majority of them belong to the first case are formatted with normal writing. I set the minority cases (the second one where result equals to prime minus Fibonacci) with red and bold format.
So prime number and Fibonacci number are in actual not completely independent with each other.
It is perfect if anyone can prove this rule in general case, or explain its reason. I do not think that this is only an accidental effect.
You can discuss here or email me at theodorenghiem@yahoo.co.nz
Regards,
Thinh Nghiem
Related Publications
If p is a prime number, consider a p-automatic sequence (un)n≥0, and let U(X) =∑n≥0 unXⁿ ∈ Fp [[X]] be∑ its generating function. Assume that there exists a formal power series V(X) =n≥0 vnXⁿ ∈ Fp [[X]] which is the compositional inverse of U, i.e., U(V(X)) = X = V(U(X)). The problem investigated in this paper is to study the properties of the seque...
We consider a generalized Fibonacci sequence(Gn) by G1, G2 € Z and Gn=Gn-1+Gn-2for any integern. Letpbe a prime number and letd(p) be the smallest positive integernwhich satisfiesp | Fn. In this article, we introduce equivalence relations for the set of generalized Fibonacci sequences. One of the equivalence relations is defined as follows. We writ...