Article Fingerprint
ReserarchID
0F8KE
We invent a novel algorithm and solve the Fibonacci prime conjecture by an interaction between proof and algorithm. From the entire set of natural numbers successively deleting the residue class 0 mod a prime, we retain this prime and possibly delete another one prime retained, then we invent a recursive sieve method, a modulo algorithm on finite sets of natural numbers, for indices of Fibonacci primes. The sifting process mechanically yields a sequence of sets of natural numbers, which converges to the index set of all Fibonacci primes. The corresponding cardinal sequence is strictly increasing. The algorithm reveals a structure of particular order topology of the index set of all Fibonacci primes, then we readily prove that the index set of all Fibonacci primes is an infinite set based on the existing theory of the structure. Some mysteries of primes are hidden in second order arithmetics.
Fengsui Liu. 2020. \u201cThere are Infinitely Many Fibonacci Primes\u201d. Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 20 (GJSFR Volume 20 Issue F5): .
Crossref Journal DOI 10.17406/GJSFR
Print ISSN 0975-5896
e-ISSN 2249-4626
Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.
Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.
Total Score: 131
Country: China
Subject: Global Journal of Science Frontier Research - F: Mathematics & Decision
Authors: Fengsui Liu (PhD/Dr. count: 0)
View Count (all-time): 187
Total Views (Real + Logic): 2331
Total Downloads (simulated): 1083
Publish Date: 2020 08, Sat
Monthly Totals (Real + Logic):
This paper attempted to assess the attitudes of students in
Advances in technology have created the potential for a new
Inclusion has become a priority on the global educational agenda,
We invent a novel algorithm and solve the Fibonacci prime conjecture by an interaction between proof and algorithm. From the entire set of natural numbers successively deleting the residue class 0 mod a prime, we retain this prime and possibly delete another one prime retained, then we invent a recursive sieve method, a modulo algorithm on finite sets of natural numbers, for indices of Fibonacci primes. The sifting process mechanically yields a sequence of sets of natural numbers, which converges to the index set of all Fibonacci primes. The corresponding cardinal sequence is strictly increasing. The algorithm reveals a structure of particular order topology of the index set of all Fibonacci primes, then we readily prove that the index set of all Fibonacci primes is an infinite set based on the existing theory of the structure. Some mysteries of primes are hidden in second order arithmetics.
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.