DOCSLIB.ORG

The Fibonacci Primes Under Modulo 4

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Fibonacci Primes Under Modulo 4 Journal of Computer Science & Computational Mathematics, Volume 3, Issue 4, December2013 57 The Fibonacci Primes Under Modulo 4 Qing Zou1 and Jun Steed Huang2 1 Department of Mathematics, Suqian College, Yangzhou University, 399 South Huanghe, Jiangsu 223800, P.R. China, 2 Suqian College, Jiangsu University, 399 South Huanghe, Jiangsu 223800, P.R. China, Corresponding addresses [email protected], [email protected] Abstract: The research on prime numbers is an interesting topic in Analytic Number Theory. The Fibonacci sequence is one of the most The Fibonacci numbers are also closely related to Lucas popular sequences in mathematics. In this paper, we will discuss the numbers, since they are a complementary pair of Lucas prime numbers of the Fibonacci sequence, which we call Fibonacci sequences [5], [6]. primes. The goal of this paper is to prove that starting with , F5 = 5 all the Fibonacci primes p are satisfied with p º1 (mod 4), on There are many applications of the Fibonacci sequence, the basis of the Pythagorean theorem. including computer algorithms such as the Fibonacci heap [7] data structure, and graphs called Fibonacci cubes [8] used for Keywords: Fibonacci sequence; Fibonacci primes; Pythagorean interconnecting parallel and distributed systems. The triple; Algebraic Number Theory. Fibonacci numbers are also Nature's numbering system. They appear almost everywhere in Nature [9], from the leaf arrangement in plants, to the pattern of the florets of a flower, 1. Introduction the bracts of a pinecone, or the scales of a pineapple [10]. The Fibonacci numbers are therefore applicable to the growth of The Fibonacci sequence (sometimes called Fibonacci every living thing, including a single cell, a grain of wheat, a numbers), which is named after Leonardo Fibonacci (c.1170 – hive of bees, and even mankind [10]. c.1250), are the numbers in the following integer sequence: 1,1,2,3,5,8,13,21,34,55,89,144, In light of the applications mentioned above, it is clear that the In some cases [1], the first two numbers in the Fibonacci Fibonacci sequence plays an important role not only in sequence are 0 and 1. It depends on the chosen starting point mathematics but also in our daily lives, such as the of the sequence. In this paper, we choose the first two obfuscation or encryption of the software code in C++ [11]. numbers to be 1 and 1, since it relates immediately to the As such, research on the sequence becomes more and more rabbit family size. important. Fibonacci primes are one of such topics. The constitution of the sequence is such that each subsequent A Fibonacci prime is a Fibonacci number that is prime. The number is the sum of the previous two. In mathematics terms, few seeds are: the sequence of the Fibonacci numbers is defined by the Fn F3 = 2,F4 = 3,F5 = 5,F7 =13,F11 = 89, recurrence formula F = 233,F =1597, 13 17 Fn = Fn-1 + Fn-2 Although Fibonacci primes with thousands of digits have with initial values [2] been found, it is not known whether there are infinitely many Fibonacci prime numbers [12]. It is one of the unsolved F1 =1,F2 =1. problems in mathematics. The divisibility of Fibonacci There are some interesting identities on Fibonacci numbers. numbers by a prime, p, is related to the Legendre symbol For example, since æ p ö é ù é ùn ç ÷. If p is a prime number then Fn+1 Fn 1 1 è 5 ø ê ú=ê ú , æ ö ëê Fn Fn-1 ûú ë 1 0 û p Fp º ç ÷ (mod p), we have è 5 ø 2 n Fn+1Fn-1 - Fn = (-1) . F æ pö º 0 (mod p). p-ç ÷ Also, there exists è 5 ø 2 2 2 2 It is also not known whether there exists a prime, , such Fn+3 = 2Fn+2 +2Fn+1 - Fn . that, 2 The common item equation of the Fibonacci sequence is F æ pö º 0 (mod p ). n n p-ç ÷ éæ ö æ ö ù è 5 ø 5 ê 1+ 5 1- 5 ú Fn = ç ÷ -ç ÷ . 5 ëêè 2 ø è 2 ø ûú Such primes (if there are any) would be called Wall-Sun-Sun primes or Fibonacci-Wieferich primes. Wall–Sun–Sun primes Several methods can be used to get this equation [3]. It is are named after Donald Dines Wall, Zhi Hong Sun and Zhi known that the Fibonacci sequence is closely related to golden Wei Sun; Fibonacci-Wieferich primes are named after Arthur ratio [4]. Wieferich. 58 Journal of Computer Science & Computational Mathematics, Volume 3, Issue 4, December2013 2 2 2 2 m n m -n 2mn m +n It is not known whether there are an infinite number of 3 4 Fibonacci primes, but we can determine the property of F3 = 2 F2 =1 F5 = 5 Fibonacci primes, which is the goal of this paper. 5 12 F4 = 3 F3 = 2 F7 =13 2. Revisiting the Pythagorean Triple 16 30 F5 = 5 F4 = 3 F9 = 34 A Pythagorean triple is made of three positive integers, x, y and , such that 2 2 2. Such a triple is often denoted as 39 80 z x + y = z F6 = 8 F5 = 5 F11 = 89 (x,y,z), and a well-known example found a few thousands years ago is (3,4,5). The name is due to the Pythagorean theorem (Chinese: Shang Gao Theorem), describing that any F F 2 2 2FF F i+1 i Fi+1 - Fi i i-1 2i+1 given right triangle has side lengths that satisfy the formula 2 2 2 2 . So, Pythagorean triples describe the relationship = Fi+2Fi-1 = F2i+2 - Fi+1 = Fi + Fi+1 of the three integer side lengths of a right triangle. Euclid's formula [13] is fundamental for generating According to the table listed above, we can see Pythagorean triples when given an arbitrary pair of positive F2 = (2FF )2 +(F2 - F2 )2. integers m and n with m > n . The formula states that 2i+1 i i-1 i+1 i That is to say, starting with , every second Fibonacci integers number can be the largest number in a Pythagorean triple. □ ì 2 2 ï x = m - n í y = 2mn Lemma 1 tells us that starting with , the Fibonacci number with an odd index is the length of a right triangle with ï 2 2 î z = m + n integer sides. form a Pythagorean triple. The triple generated by Euclid's Lemma 2. Starting with , Fibonacci primes have a formula is primitive if, and only if, and are coprime prime index. In other words, starting with , all and m-n is odd. Fibonacci primes have an odd index. Euclid's formula does not generate all triples, but can generate Proof. Suppose there exists a Fibonacci prime with a all primitive triples. This can be remedied by inserting an composite index m and a is a factor of m , then a divides additional parameter, k , into the formula. The following m . For if a divides m , then F divides F , meaning that formula will generate all Pythagorean triples uniquely: a m is a factor of . It is a contradiction. Therefore, lemma 2 Fa Fm is proved. □ ì 2 2 ï x = k(m - n ) ï What we need to point out is that though starting with , í y = k(2mn) Fibonacci primes have a prime index, not every prime larger ï 2 2 îï z = k(m + n ) than 5 is an example of a Fibonacci prime, F = 4181 = 37 ´113 is a counter example. 19 where m,n and are positive integers with , odd, and with and coprime. 4. The Modulo Theorem and Proof The Euclidian formula is so prominent that the proof can be By lemma 1 and lemma 2, we can easily get that, starting with seen in almost every elementary number theory book [14]. So, , all the Fibonacci primes can be the length of the we will not give the proof here. hypotenuse of a right triangle with integer sides. Consequently, if we want to prove that, starting with , 3. The Parity Lemmas and Proofs all the Fibonacci primes satisfy p º1(mod 4), we just need to prove that for all prime numbers p, if p º1 mod 4 , then The Pythagorean triples can be used to prove the following ( ) lemma. x2 + y2 = p2 has integer solutions. Lemma 1. Starting with F5 = 5 , every second Fibonacci Before we prove the proposition, we need to introduce another number is the length of the hypotenuse of a right triangle with conclusion in Algebraic Number Theory. integer sides, or in other words, the largest number in a Pythagorean triple. Lemma 3. (1) If is a prime number congruent to 1 modulo 4, then there exists a prime element a in [i] such that Proof. We can prove this lemma by the following table. p =aa (a is also a prime element of ). Journal of Computer Science & Computational Mathematics, Volume 3, Issue 4, December2013 59 Theorem 1. Starting with , all Fibonacci primes (2) If is a prime number congruent to 3 modulo 4, then satisfy p º1(mod 4). is a prime element in . Proof. Let's prove this conclusion in two steps. Note. An element in is a prime element if it satisfies: Step 1. Let be a prime number and , then (a) is nonzero and not a unit (invertible element). there exists a right triangle with integer sides such that the (b) If a,b Î [i] and ab Îa [i], then a Îa [i] or length of hypotenuse is .
Load more

Recommended publications
  • On the Prime Number Subset of the Fibonacci Numbers
    Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach On the Prime Number Subset of the Fibonacci Numbers Lacey Fish1 Brandon Reid2 Argen West3 1Department of Mathematics Louisiana State University Baton Rouge, LA 2Department of Mathematics University of Alabama Tuscaloosa, AL 3Department of Mathematics University of Louisiana Lafayette Lafayette, LA Lacey Fish, Brandon Reid, Argen West SMILE Presentations, 2010 LSU, UA, ULL Sieve Theory Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach Basic Definitions What is a sieve? What is a sieve? A sieve is a method to count or estimate the size of “sifted sets” of integers. Well, what is a sifted set? A sifted set is made of the remaining numbers after filtering. Lacey Fish, Brandon Reid, Argen West LSU, UA, ULL Sieve Theory Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach Basic Definitions What is a sieve? What is a sieve? A sieve is a method to count or estimate the size of “sifted sets” of integers. Well, what is a sifted set? A sifted set is made of the remaining numbers after filtering. Lacey Fish, Brandon Reid, Argen West LSU, UA, ULL Sieve Theory Introduction to Sieves Fibonacci Numbers Fibonacci sequence mod a prime Probability of Fibonacci Primes Matrix Approach Basic Definitions History Two Famous and Useful Sieves Sieve of Eratosthenes Brun’s Sieve Lacey Fish, Brandon Reid, Argen West
    [Show full text]
  • There Are Infinitely Many Mersenne Primes
    Scan to know paper details and author's profile There are Infinitely Many Mersenne Primes Fengsui Liu ZheJiang University Alumnus ABSTRACT 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 for exponents of Mersenne primes. This is a novel algorithm on sets of natural numbers. The algorithm mechanically yields a sequence of sets of exponents of almost Mersenne primes, which converge to the set of exponents of all Mersenne primes. The corresponding cardinal sequence is strictly increasing. We capture a particular order topological structure of the set of exponents of all Mersenne primes. The existing theory of this structure allows us to prove that the set of exponents of all Mersenne primes is an infnite set . Keywords and phrases: Mersenne prime conjecture, modulo algorithm, recursive sieve method, limit of sequence of sets. Classification: FOR Code: 010299 Language: English LJP Copyright ID: 925622 Print ISSN: 2631-8490 Online ISSN: 2631-8504 London Journal of Research in Science: Natural and Formal 465U Volume 20 | Issue 3 | Compilation 1.0 © 2020. Fengsui Liu. This is a research/review paper, distributed under the terms of the Creative Commons Attribution-Noncom-mercial 4.0 Unported License http://creativecommons.org/licenses/by-nc/4.0/), permitting all noncommercial use, distribution, and reproduction in any medium, provided the original work is properly cited. There are Infinitely Many Mersenne Primes Fengsui Liu ____________________________________________ ABSTRACT 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.
    [Show full text]
  • There Are Infinitely Many Fibonacci Primes
    Global Journal of Science Frontier Research: F Mathematics & Decision Science Volume 20 Issue 5 Version 1.0 Year 2020 Type : Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Online ISSN: 2249-4626 & Print ISSN: 0975-5896 There are Infinitely Many Fibonacci Primes By Fengsui Liu Zhe Jiang University Abstract- 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. Keywords and phrases: Fibonacci prime conjecture, recursive sieve method, order topology, limit of a sequence of sets. GJSFR-F Classification: MSC 2010: 11N35, 11N32, 11U09, 11Y16, 11B37, 11B50 Ther eareInfinitelyManyFibonacciPrimes Strictly as per the compliance and regulations of: © 2020. Fengsui Liu. This is a research/review paper, distributed under the terms of the Creative Commons Attribution- Noncommercial 3.0 Unported License http://creativecommons.org/licenses/by-nc/3.0/), permitting all non commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.
    [Show full text]
  • Fibonacci's Answer to Primality Testing?
    FIBONACCI'S ANSWER TO PRIMALITY TESTING? JULIAN BEAUCHAMP Abstract. In this paper, we consider various approaches to primality testing and then ask whether an effective deterministic test for prime numbers can be found in the Fibonacci numbers. Introduction Prime numbers play an important role in encryption and cyber-security. They protect digitial data, including personal data and bank details. Testing whether a number is prime or not, is therefore becoming increasingly important for mathe- maticians and for those working in digitial security. The study of prime numbers and their properties go back to the ancient Greek mathematician Pythagoras (570-495 BC) who understood the idea of primality. But a primality test is a test to determine whether or not a number is prime. This is different from finding a number's constituent prime factors (also known as prime factorization). A number is said to be prime if it is divisible only by 1 and itself. Otherwise it is composite. When the numbers are small, it is relatively easy to determine whether a number is prime. But as they get exponentially larger they get harder to determine. So the pressing question is what makes an efficient algorithm? The following characteristics make an efficient algorithm - general, deterministic, unconditional, and polynomial:1 General. An algorithm that is general works for all numbers. Algorithms that are not general only work on certain numbers (e.g. the Lucas-Lehmer test for Mersenne numbers). Deterministic.A deterministic test (e.g. the Lucas-Lehmer Test) will tell us with absolute certainty whether a number is prime or not every time it is run.
    [Show full text]
  • Some Open Problems
    Some Open Problems 1. A sequence of Mersenne numbers can be generated by the recursive function ak+1 := 2ak + 1, for all k 2 N, with a0 = 0. We obtain the sequence 1; 3; 7; 15; 31; 63; 127;:::: Note that each term here is of the form 2k − 1, for k 2 N. Any prime in this sequence is called a Mersenne prime, i.e., a prime having the form 2k − 1 for some k 2 N. Prove or disprove that there are infinitely many Mersenne primes! Observations: Note that 15 = 24 − 1 and 63 = 26 − 1 are not Mersenne primes. If k is composite then 2k − 1 is also composite (not prime). If k is composite then k = `m. Then 2k − 1 = (2`)m − 1 = (2` − 1)((2`)m−1 + (2`)m−2 + ::: + 2` + 1): Thus, 2` − 1 divides 2k − 1. If 2k − 1 is a prime then either 2` − 1 = 2k − 1 or 2` − 1 = 1. This implies that k = ` (m = 1) or ` = 1 contradicting the fact that k is composite. Therefore, a necessary condition for a Mersenne number 2k − 1 to be prime is k should be prime. This is not a sufficient condition, for instance, 11 is prime but 211 − 1 = 2047 = 23 × 89 is not a prime. More generally, if ak − 1 is prime then either k = 1 or a = 2. Since, by geometric sum, ak − 1 = (a − 1)(ak−1 + ak−2 + ::: + a + 1) we get ak − 1 is divisible by a − 1. Since ak − 1 is prime either a − 1 = ak − 1 or a − 1 = 1.
    [Show full text]
  • Fibonacci Sequence & the Fibonacci Prime Conjecture
    Fibonacci Sequence & The Fibonacci Prime Conjecture Evan Amoranto PSUMS 2012 Mentor: Dr. Dana Clahane Leonardo Pisano Bigollo (1170 – 1250) was also know simply as Fibonacci. He used the number sequence in a book called Liber Abaci ( Book of Calculation). Fibonacci did not discover the sequence but used it as an example in Liber Abaci. Define what a Sequence Defn: We define a sequence to be a list of objects that are in some order or a function whose domain is either { 1,2,3,…,n} for some n ∈ ℕ or is ℕ itself. EX) Let f: ℕ → ℝ be given by f(n) = since the dom(f) = ℕ, f is a sequence by definition. Define the Fibonacci Sequence Defn: The Fibonacci Sequence is given by the equation Where Each number in the sequence is the sum of the previous two numbers, starting with 0 and 1 {0,1,1,2,3,5,8,13,21,34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811,……..} The Fibonacci sequence appears in Pascal’s Triangle as the sum of shallow diagonals Fibonacci’s Sequence can also be seen in nature A Fibonacci spiral created by drawing circular arcs connecting the opposite corners of squares in the Fibonacci tiling The Fibonacci Spiral can be found in seashells Even the planets have something to do with Fibonacci’s sequence. It is called the dance of the planets. Take the orbits of any two planets and draw a line between the two planet positions every few days.
    [Show full text]
  • Perfect Powers Generated by the Twisted Fermat Cubic 3
    PERFECT POWERS GENERATED BY THE TWISTED FERMAT CUBIC JONATHAN REYNOLDS Abstract. On the twisted Fermat cubic, an elliptic divisibility sequence arises as the sequence of denominators of the multiples of a single rational point. It is shown that there are finitely many perfect powers in such a sequence whose first term is greater than 1. Moreover, if the first term is divisible by 6 and the generating point is triple another rational point then there are no perfect powers in the sequence except possibly an lth power for some l dividing the order of 2 in the first term. 1. Introduction A divisibility sequence is a sequence W1, W2, W3,... of integers satisfying Wn Wm whenever n m. The arithmetic of these has been and continues to be of great| interest. Ward| [41] studied a large class of recursive divisibility sequences and gave equations for points and curves from which they can be generated (see also [32]). In particular, Lucas sequences can be generated from curves of genus 0. Although Ward did not make such a distinction, sequences generated by curves of genus 1 have become exclusively known as elliptic divisibility sequences [20, 21, 24, 25] and have applications in Logic [11, 17, 18] as well as Cryptography [38]. See [36, 37] for background on elliptic curves (genus-1 curves with a point). Let d Z be cube-free and consider the elliptic curve ∈ C : u3 + v3 = d. It is sometimes said that C is a twist of the Fermat cubic. The set C(Q) forms a group under the chord and tangent method: the (projective) point [1, 1, 0] is the identity and inversion is given by reflection in the line u = v.
    [Show full text]
  • A-Primer-On-Prime-Numbers.Pdf
    A Primer on Prime Numbers Prime Numbers “Prime numbers are the very atoms of arithmetic. The primes are the jewels studded throughout the vast expanse of the infinite universe of numbers that mathematicians have studied down the centuries.” Marcus du Sautoy, The Music of the Primes 2 • Early Primes • Named Primes • Hunting for Primes • Visualizing Primes • Harnessing Primes 3 Ishango bone The Ishango bone is a bone tool, dated to the Upper Paleolithic era, about 18,000 to 20,000 BC. It is a dark brown length of bone, the fibula of a baboon, It has a series of tally marks carved in three columns running the length of the tool Note: image is 4 reversed A History and Exploration of Prime Numbers • In the book How Mathematics Happened: The First 50,000 Years, Peter Rudman argues that the development of the concept of prime numbers could have come about only after the concept of division, which he dates to after 10,000 BC, with prime numbers probably not being understood until about 500 BC. He also writes that "no attempt has been made to explain why a tally of something should exhibit multiples of two, prime numbers between 10 and 20,… Left column 5 https://en.wikipedia.org/wiki/Ishango_bone Euclid of Alexandria 325-265 B.C. • The only man to summarize all the mathematical knowledge of his times. • In Proposition 20 of Book IX of the Elements, Euclid proved that there are infinitely many prime numbers. https://en.wikipedia.org/wiki/Euclid 6 Eratosthenes of Cyrene 276-194 B.C.
    [Show full text]
  • School of Mathematics and Statistics, Wuhan University, Wuhan, People's
    #A21 INTEGERS 19 (2019) PERFECT NUMBERS AND FIBONACCI PRIMES II Tianxin Cai School of Mathematical Sciences, Zhejiang University, Hangzhou, People’s Republic of China [email protected] Liuquan Wang1 School of Mathematics and Statistics, Wuhan University, Wuhan, People’s Republic of China [email protected]; [email protected] Yong Zhang School of Mathematics and Statistics, Changsha University of Science and Technology, Changsha, People’s Republic of China [email protected] Received: 2/6/18 , Accepted: 12/21/18 , Published: 3/15/19 Abstract 2 We aim to solve the equation σ2(n) = `n + An + B, where `, A, and B are given integers. We find that this equation has infinitely many solutions only if ` = 1. Then 2 we characterize the solutions to the equation σ2(n) = n + An + B. We prove that, except for finitely many computable solutions, all the solutions to this equation with 2 (A, B) = (L2m, F2m 1) are n = F2k+1F2k+2m+1, where both F2k+1 and F2k+2m+1 are Fibonacci primes.− Meanwhile, we show that the twin prime conjecture holds if and only if the equation σ (n) n2 = 2n + 5 has infinitely many solutions. 2 − 1. Introduction and Main Results A positive integer is called a perfect number if it is equal to the sum of its proper divisors. In other words, a positive integer n is a perfect number if and only if d = n. (1) d n 0<d<nX| 1Corresponding author INTEGERS: 19 (2019) 2 k Let σk(n) := d . When k = 1, we usually write σ1(n) as σ(n).
    [Show full text]
  • Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May
    Proof of Infinite Number of Fibonacci Primes Stephen Marshall 22 May 2014 Abstract This paper presents a complete and exhaustive proof of that an infinite number of Fibonacci Primes exist . The approach to this proof uses same logic that Euclid used to prove there are an infinite number of prime numbers. Then we prove that if p > 1 and d > 0 are integers, that p and p + d are both primes if and only if for integer n (see reference 1 and 2): 1 ( 1)dd! 1 1 = ( 1)! + + + p + d p p + d − 푛 푝 − � � 푝 We use this proof for p = Fy-1 and d = Fy-2 to prove the infinitude of Fibonacci prime numbers. The author would like to give many thanks to the authors of 1001 Problems in Classical Number Theory, Jean-Marie De Koninck and Armel Mercier, 2004, Exercise Number 161 (see Reference 1). The proof provided in Exercise 6 is the key to making this paper on the finitude or Fibonacci Primes possible. 1 Introduction The Fibonacci prime conjecture, was made by Alphonse de Fibonacci in 1849. Alphonse de Fibonacci (1826 – 1863) was a French mathematician whose father, Jules de Fibonacci (1780-1847) was prime minister of Charles X until the Bourbon dynasty was overthrown in1830. Fibonacci attended the École Polytechnique (commonly known as Polytechnique) a French public institution of higher education and research, located in Palaiseau near Paris. In 1849, the year Alphonse de Fibonacci was admitted to Polytechnique, he made what's known as Fibonacci's conjecture: For every positive integer k, there are infinitely many prime gaps of size 2k.
    [Show full text]
  • Tutorme Subjects Covered.Xlsx
    Subject Group Subject Topic Computer Science Android Programming Computer Science Arduino Programming Computer Science Artificial Intelligence Computer Science Assembly Language Computer Science Computer Certification and Training Computer Science Computer Graphics Computer Science Computer Networking Computer Science Computer Science Address Spaces Computer Science Computer Science Ajax Computer Science Computer Science Algorithms Computer Science Computer Science Algorithms for Searching the Web Computer Science Computer Science Allocators Computer Science Computer Science AP Computer Science A Computer Science Computer Science Application Development Computer Science Computer Science Applied Computer Science Computer Science Computer Science Array Algorithms Computer Science Computer Science ArrayLists Computer Science Computer Science Arrays Computer Science Computer Science Artificial Neural Networks Computer Science Computer Science Assembly Code Computer Science Computer Science Balanced Trees Computer Science Computer Science Binary Search Trees Computer Science Computer Science Breakout Computer Science Computer Science BufferedReader Computer Science Computer Science Caches Computer Science Computer Science C Generics Computer Science Computer Science Character Methods Computer Science Computer Science Code Optimization Computer Science Computer Science Computer Architecture Computer Science Computer Science Computer Engineering Computer Science Computer Science Computer Systems Computer Science Computer Science Congestion Control
    [Show full text]
  • Prime Numbers– Things Long-Known and Things New- Found
    Karl-Heinz Kuhl PRIME NUMBERS– THINGS LONG-KNOWN AND THINGS NEW- FOUND A JOURNEY THROUGH THE LANDSCAPE OF THE PRIME NUMBERS Amazing properties and insights – not from the perspective of a mathematician, but from that of a voyager who, pausing here and there in the landscape of the prime numbers, approaches their secrets in a spirit of playful adventure, eager to experiment and share their fascination with others who may be interested. Third, revised and updated edition (2020) 0 Prime Numbers – things long- known and things new-found A journey through the landscape of the prime numbers Amazing properties and insights – not from the perspective of a mathematician, but from that of a voyager who, pausing here and there in the landscape of the prime numbers, approaches their secrets in a spirit of playful adventure, eager to experiment and share their fascination with others who may be interested. Dipl.-Phys. Karl-Heinz Kuhl Parkstein, December 2020 1 1 + 2 + 3 + 4 + ⋯ = − 12 (Ramanujan) Web: https://yapps-arrgh.de (Yet another promising prime number source: amazing recent results from a guerrilla hobbyist) Link to the latest online version https://yapps-arrgh.de/primes_Online.pdf Some of the text and Mathematica programs have been removed from the free online version. The printed and e-book versions, however, contain both the text and the programs in their entirety. Recent supple- ments to the book can be found here: https://yapps-arrgh.de/data/Primenumbers_supplement.pdf Please feel free to contact the author if you would like a deeper insight into the many Mathematica programs.
    [Show full text]