DOCSLIB.ORG

Math 706, Theory of Numbers Kansas State University Spring 2019 Todd Cochrane

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Math 706, Theory of Numbers Kansas State University Spring 2019 Todd Cochrane Math 706, Theory of Numbers Kansas State University Spring 2019 Todd Cochrane Department of Mathematics Kansas State University Contents Notation3 Chapter 1. Axioms for the set of Integers Z 5 1.1. Ring Properties of Z 5 1.2. Order Properties of Z 5 1.3. Discreteness Axioms.6 1.4. Additional Properties of Z.7 Chapter 2. Divisibility and Unique Factorization9 2.1. Divisibility and Greatest Common Divisors9 2.2. Division Algorithms 10 2.3. Euclidean Algorithm 10 2.4. Euclidean Domains 11 2.5. Linear Combinations and GCDLC Theorem 13 2.6. Solving the equation ax + by = d, with d = (a; b) 13 2.7. The linear equation ax + by = c 15 2.8. Primes and Euclid's Lemma 16 2.9. Unique Factorization in Z 16 2.10. Properties of GCDs and LCMs 17 2.11. Units, Primes and Irreducibles 18 2.12. UFDs, PIDs and Euclidean Domains 19 2.13. Gaussian Integers 20 2.14. The Set of Primes 21 Chapter 3. Modular Arithmetic 25 3.1. Basic properties of congruences 25 3.2. The ring of integers (mod m), Zm 26 3.3. Congruences in general rings 27 3.4. Multiplicative inverses and Cancelation Laws 27 3.5. The Group of units (mod m) and the Euler phi-function 28 3.6. A few results from Group Theory 29 3.7. Fermat's Little Theorem, Euler's Theorem and Wilson's Theorem 29 3.8. Chinese Remainder Theorem 30 3.9. Group of units modulo a prime, G(p) 32 3.10. Group of units G(pe) 34 3.11. Group of units G(m) for arbitrary m 35 Chapter 4. Polynomial Congruences 37 4.1. Linear Congruences 37 4.2. Power Congruences, xn ≡ a (mod m) 37 3 4 CONTENTS 4.3. A general quadratic congruence 39 4.4. General Polynomial Congruences: Lifting Solutions 39 4.5. Counting Solutions of Polynomial Congruences 42 Chapter 5. Quadratic Residues and Quadratic Reciprocity 43 5.1. Introduction 43 5.2. Properties of the Legendre Symbol 43 5.3. Proof of the Law of Quadratic Reciprocity 45 5.4. The Jacobi Symbol 47 5.5. Local solvability implies global solvability 50 5.6. Sums of two Squares 51 Chapter 6. Primality Testing, Mersenne Primes and Fermat Primes 55 6.1. Basic Primality Test 55 6.2. Pseudoprimes and Carmichael Numbers 55 6.3. Mersenne Primes and Fermat Primes 57 Chapter 7. Arithmetic Functions 59 7.1. Properties of Greatest Integer Function and Binomial Coefficients 59 7.2. The Divisor function and Sigma function 60 7.3. Multiplicative Function 60 7.4. Perfect Numbers 62 7.5. The M¨obiusFunction 63 7.6. Estimating Arithmetic Sums 63 7.7. M¨obiusInversion Formula 65 7.8. Estimates for τ(n), σ(n) and φ(n) 66 Chapter 8. Recurrence Sequences 69 8.1. The Fibonacci Sequence 69 8.2. Second order linear recurrences 70 8.3. A Matrix view of the Fibonacci Sequence 70 8.4. Congruence and Divisibility Properties of the Fibonacci Sequence 71 8.5. Periodicity of the Fibonacci sequence (mod m) 72 8.6. Further Properties of the Fibonacci Sequence 74 Chapter 9. Diophantine Equations 77 9.1. Preliminaries 77 9.2. Systems of Linear Equations 77 9.3. Pythagorean Triples 81 9.4. Rational Points on Conics 82 9.5. The Equations x4 + y4 = z2 and x2 + 4y4 = z4 83 9.6. Cubic Curves 84 Chapter 10. Elliptic Curves 87 10.1. Definition of an Elliptic Curve 87 10.2. Addition of Points on an Elliptic Curve 87 10.3. The Projective Plane 89 10.4. Elliptic curves in the projective plane 90 10.5. The Elliptic Curve as an abelian Group 90 10.6. The Pollard (p − 1)-method of Factorization 93 CONTENTS 5 10.7. Elliptic Curve Method of Factorization 94 Chapter 11. Prime Number Theory 97 11.1. Euler-Maclaurin Summation Formula and Estimating Factorials 97 11.2. Chebyshev Estimate for π(x) 98 11.3. Bertrand's Postulate 100 11.4. The von Mangoldt function and the function 101 11.5. The sum of reciprical primes 103 Chapter 12. Binary Quadratic Forms 105 12.1. Matrix representation of quadratic form 105 12.2. Equivalent Forms and Reduced Forms 106 12.3. Representation by Positive Definite Binary Quadratic Forms 108 12.4. Class Number 109 12.5. Congruence test for Representation 109 12.6. Tree diagram of Values Represented by a Binary Quadratic Form 111 Chapter 13. Geometry of Numbers 113 13.1. Lattices and Bases 113 13.2. Discrete Subgroups of Rn 113 13.3. Minkowski's Fundamental Theorem 114 13.4. Canonical Basis Theorem and Sublattices 115 13.5. Lagrange's 4-squares Theorem 116 13.6. Sums of Three Squares 118 13.7. The Legendre Equation 118 13.8. The Catalan Equation 119 Chapter 14. Best Rational Approximations and Continued Fractions 121 14.1. Approximating real numbers by rationals 121 14.2. Continued Fractions 122 14.3. Convergents to Continued Fractions 123 14.4. Infinite Continued Fraction Expansions 125 14.5. Best Rational Approximations to Irrationals 126 14.6. Hurwitz's Theorem 128 14.7. The set of all best rational approximations 129 14.8. Quadratic Irrationals and Periodic Continued Fractions 130 14.9. Pell Equations 133 14.10. Liouville's Theorem 136 Chapter 15. Dirichlet Series 139 15.1. Definition and Convergence of a Dirichlet series 139 15.2. Important examples of Dirchlet Series 140 15.3. Another Proof of the M¨obiusInversion Formula 141 15.4. Product Formula for Dirichlet Series 142 15.5. Analytic properties of Dirichlet series 142 15.6. The Riemann Zeta Function and the Riemann Hypothesis 145 15.7. More on the zeta function 146 Appendix A. Preliminaries 149 Appendix B. Proof of Additional Properties of Z 153 6 CONTENTS Appendix C. Discreteness Axioms for Z 157 C.1. Equivalence of the Discreteness Axioms 157 C.2. Proof of Additional Discreteness Properties 158 C.3. Proof by Induction 158 Appendix D. Review of Groups, Rings and Fields 163 D.1. Definition of a Ring 163 D.2. Basic properties of Rings 164 D.3. Units and Zero Divisors 164 D.4. Integral Domains and Fields 165 D.5. Polynomial Rings 165 D.6. Ring homomorphisms and Ideals 168 D.7. Group Theory 170 D.8. Lagrange's Theorem 172 D.9. Normal Subgroups and Group Homomorphisms 173 Appendix. Bibliography 175 Notation N = f1; 2; 3; 4; 5;::: g = Natural numbers Z = f0; ±1; ±; 2; ±3;::: g = Integers E = f0; ±2; ±4; ±6;::: g = Even integers O = {±1; ±3; ±5;::: g = Odd integers Q = fa=b : a; b 2 Z; b 6= 0g = Rational numbers R = Real numbers C = Complex numbers Z[i] = fa + bi : a; b 2 Zg = Gaussian Integers Zm = Ring of integers mod m [a]m = fa + mx : x 2 Zg = Residue class of a mod m Um = Multiplicative group of units mod m a−1 (mod m) = \multiplicative inverse of a (mod m)" φ(m) = Euler phi-function (a; b) = gcd(a; b) = greatest common divisor of a and b [a; b] = lcm[a; b] = least common multiple of a and b ajb = \a divides b" M2;2(R) = Ring of 2 × 2 matrices over a given ring R R[x] = Ring of polynomials over R jSj = order or cardinality of a set S Sn = n-th symmetric group log(x) = natural logarithm of x \ intersection [ union ; empty set ⊆ subset 9 there exists 9! there exists a unique 8 for all ) implies , equivalent to iff if and only if 2 element of ≡ congruent to 7 CHAPTER 1 Axioms for the set of Integers Z 1.1. Ring Properties of Z We shall assume the following properties as axioms for the set of integers. 1.1.1. Addition Properties. There is a binary operation + on Z, called addition, satisfying a) Addition is well defined, that is, given any two integers a; b, a+b is a uniquely defined integer. b) Substitution Law for addition: If a = b and c = d then a + c = b + d. c) The set of integers is closed under addition. For any a; b 2 Z, a + b 2 Z. d) Addition is commutative. For any a; b 2 Z, a + b = b + a. e) Addition is associative. For any a; b; c 2 Z,(a + b) + c = a + (b + c). f) There is a zero element 0 2 Z (also called the additive identity), satisfying 0 + a = a = a + 0 for any a 2 Z. g) For any a 2 Z, there exists an additive inverse −a 2 Z satisfying a + (−a) = 0 = (−a) + a. Note 1.1.1. Properties a),b), and c) above are implicit in the definition of a binary operation on Z. Definition 1.1.1. Subtraction is defined by a − b = a + (−b) for a; b 2 Z. 1.1.2. Multiplication Properties. There is an operation · (or ×) on Z called multiplication, satisfying, a) Multiplication is well defined, that is, given any two integers a; b, a · b is a uniquely defined integer. b) Substitution Law for multiplication: If a = b and c = d then ac = bd. c) Z is closed under multiplication. For any a; b 2 Z, a · b 2 Z. d) Multiplication is commutative. For any a; b 2 Z, ab = ba. e) Multiplication is associative. For any a; b; c 2 Z,(ab)c = a(bc). f) There is an identity element 1 2 Z satisfying 1 · a = a = a · 1 for any a 2 Z. 1.1.3. Distributive law. This is the one property that combines both ad- dition and multiplication.
Load more

Recommended publications
  • An Analysis of Primality Testing and Its Use in Cryptographic Applications
    An Analysis of Primality Testing and Its Use in Cryptographic Applications Jake Massimo Thesis submitted to the University of London for the degree of Doctor of Philosophy Information Security Group Department of Information Security Royal Holloway, University of London 2020 Declaration These doctoral studies were conducted under the supervision of Prof. Kenneth G. Paterson. The work presented in this thesis is the result of original research carried out by myself, in collaboration with others, whilst enrolled in the Department of Mathe- matics as a candidate for the degree of Doctor of Philosophy. This work has not been submitted for any other degree or award in any other university or educational establishment. Jake Massimo April, 2020 2 Abstract Due to their fundamental utility within cryptography, prime numbers must be easy to both recognise and generate. For this, we depend upon primality testing. Both used as a tool to validate prime parameters, or as part of the algorithm used to generate random prime numbers, primality tests are found near universally within a cryptographer's tool-kit. In this thesis, we study in depth primality tests and their use in cryptographic applications. We first provide a systematic analysis of the implementation landscape of primality testing within cryptographic libraries and mathematical software. We then demon- strate how these tests perform under adversarial conditions, where the numbers being tested are not generated randomly, but instead by a possibly malicious party. We show that many of the libraries studied provide primality tests that are not pre- pared for testing on adversarial input, and therefore can declare composite numbers as being prime with a high probability.
    [Show full text]
  • FACTORING COMPOSITES TESTING PRIMES Amin Witno
    WON Series in Discrete Mathematics and Modern Algebra Volume 3 FACTORING COMPOSITES TESTING PRIMES Amin Witno Preface These notes were used for the lectures in Math 472 (Computational Number Theory) at Philadelphia University, Jordan.1 The module was aborted in 2012, and since then this last edition has been preserved and updated only for minor corrections. Outline notes are more like a revision. No student is expected to fully benefit from these notes unless they have regularly attended the lectures. 1 The RSA Cryptosystem Sensitive messages, when transferred over the internet, need to be encrypted, i.e., changed into a secret code in such a way that only the intended receiver who has the secret key is able to read it. It is common that alphabetical characters are converted to their numerical ASCII equivalents before they are encrypted, hence the coded message will look like integer strings. The RSA algorithm is an encryption-decryption process which is widely employed today. In practice, the encryption key can be made public, and doing so will not risk the security of the system. This feature is a characteristic of the so-called public-key cryptosystem. Ali selects two distinct primes p and q which are very large, over a hundred digits each. He computes n = pq, ϕ = (p − 1)(q − 1), and determines a rather small number e which will serve as the encryption key, making sure that e has no common factor with ϕ. He then chooses another integer d < n satisfying de % ϕ = 1; This d is his decryption key. When all is ready, Ali gives to Beth the pair (n; e) and keeps the rest secret.
    [Show full text]
  • Primality Test
    Primality test A primality test is an algorithm for determining whether (6k + i) for some integer k and for i = −1, 0, 1, 2, 3, or 4; an input number is prime. Amongst other fields of 2 divides (6k + 0), (6k + 2), (6k + 4); and 3 divides (6k mathematics, it is used for cryptography. Unlike integer + 3). So a more efficient method is to test if n is divisible factorization, primality tests do not generally give prime by 2 or 3, then to check through all the numbers of form p factors, only stating whether the input number is prime 6k ± 1 ≤ n . This is 3 times as fast as testing all m. or not. Factorization is thought to be a computationally Generalising further, it can be seen that all primes are of difficult problem, whereas primality testing is compara- the form c#k + i for i < c# where i represents the numbers tively easy (its running time is polynomial in the size of that are coprime to c# and where c and k are integers. the input). Some primality tests prove that a number is For example, let c = 6. Then c# = 2 · 3 · 5 = 30. All prime, while others like Miller–Rabin prove that a num- integers are of the form 30k + i for i = 0, 1, 2,...,29 and k ber is composite. Therefore the latter might be called an integer. However, 2 divides 0, 2, 4,...,28 and 3 divides compositeness tests instead of primality tests. 0, 3, 6,...,27 and 5 divides 0, 5, 10,...,25.
    [Show full text]
  • Elementary Number Theory
    Elementary Number Theory Peter Hackman HHH Productions November 5, 2007 ii c P Hackman, 2007. Contents Preface ix A Divisibility, Unique Factorization 1 A.I The gcd and B´ezout . 1 A.II Two Divisibility Theorems . 6 A.III Unique Factorization . 8 A.IV Residue Classes, Congruences . 11 A.V Order, Little Fermat, Euler . 20 A.VI A Brief Account of RSA . 32 B Congruences. The CRT. 35 B.I The Chinese Remainder Theorem . 35 B.II Euler’s Phi Function Revisited . 42 * B.III General CRT . 46 B.IV Application to Algebraic Congruences . 51 B.V Linear Congruences . 52 B.VI Congruences Modulo a Prime . 54 B.VII Modulo a Prime Power . 58 C Primitive Roots 67 iii iv CONTENTS C.I False Cases Excluded . 67 C.II Primitive Roots Modulo a Prime . 70 C.III Binomial Congruences . 73 C.IV Prime Powers . 78 C.V The Carmichael Exponent . 85 * C.VI Pseudorandom Sequences . 89 C.VII Discrete Logarithms . 91 * C.VIII Computing Discrete Logarithms . 92 D Quadratic Reciprocity 103 D.I The Legendre Symbol . 103 D.II The Jacobi Symbol . 114 D.III A Cryptographic Application . 119 D.IV Gauß’ Lemma . 119 D.V The “Rectangle Proof” . 123 D.VI Gerstenhaber’s Proof . 125 * D.VII Zolotareff’s Proof . 127 E Some Diophantine Problems 139 E.I Primes as Sums of Squares . 139 E.II Composite Numbers . 146 E.III Another Diophantine Problem . 152 E.IV Modular Square Roots . 156 E.V Applications . 161 F Multiplicative Functions 163 F.I Definitions and Examples . 163 CONTENTS v F.II The Dirichlet Product .
    [Show full text]
  • K-Fibonacci Sequences Modulo M
    Available online at www.sciencedirect.com Chaos, Solitons and Fractals 41 (2009) 497–504 www.elsevier.com/locate/chaos k-Fibonacci sequences modulo m Sergio Falcon *,A´ ngel Plaza Department of Mathematics, University of Las Palmas de Gran Canaria (ULPGC), 35017 Las Palmas de Gran Canaria, Spain Accepted 14 February 2008 Abstract We study here the period-length of the k-Fibonacci sequences taken modulo m. The period of such cyclic sequences is know as Pisano period, and the period-length is denoted by pkðmÞ. It is proved that for every odd number k, 2 2 pkðk þ 4Þ¼4ðk þ 4Þ. Ó 2008 Elsevier Ltd. All rights reserved. 1. Introduction Many references may be givenpffiffi for Fibonacci numbers and related issues [1–9]. As it is well-known Fibonacci num- 1þ 5 bers and Golden Section, / ¼ 2 , appear in modern research in many fields from Architecture, Nature and Art [10– 16] to theoretical physics [17–21]. The paper presented here is focused on determining the length of the period of the sequences obtained by reducing k- Fibonacci sequences taking modulo m. This problem may be viewed in the context of generating random numbers, and it is a generalization of the classical Fibonacci sequence modulo m. k-Fibonacci numbers have been ultimately intro- duced and studied in different contexts [22–24] as follows: Definition 1. For any integer number k P 1, the kth Fibonacci sequence, say fF k;ngn2N is defined recurrently by: F k;0 ¼ 0; F k;1 ¼ 1; and F k;nþ1 ¼ kF k;n þ F k;nÀ1 for n P 1: Note that if k is a real variable x then F k;n ¼ F x;n and they correspond to the Fibonacci polynomials defined by: 8 9 <> 1ifn ¼ 0 => F ðxÞ¼ x if n ¼ 1 : nþ1 :> ;> xF nðxÞþF nÀ1ðxÞ if n > 1 Particular cases of the previous definition are: If k ¼ 1, the classical Fibonacci sequence is obtained: F 0 ¼ 0; F 1 ¼ 1, and F nþ1 ¼ F n þ F nÀ1 for n P 1 : fF ngn2N ¼ f0; 1; 1; 2; 3; 5; 8; ...g: * Corresponding author.
    [Show full text]
  • Complete Generalized Fibonacci Sequences Modulo Primes
    Complete Generalized Fibonacci Sequences Modulo Primes Mohammad Javaheri, Nikolai A. Krylov Siena College, Department of Mathematics 515 Loudon Road, Loudonville NY 12211, USA [email protected], [email protected] Abstract We study generalized Fibonacci sequences F = P F QF − n+1 n − n 1 with initial values F0 = 0 and F1 = 1. Let P,Q be nonzero integers such that P 2 4Q is not a perfect square. We show that if Q = 1 − ∞ ± then the sequence F misses a congruence class modulo every { n}n=0 prime large enough. On the other hand, if Q = 1, we prove that ∞ 6 ± (under GRH) the sequence F hits every congruence class mod- { n}n=0 ulo infinitely many primes. A generalized Fibonacci sequence with integer parameters (P, Q) is a second order homogeneous difference equation generated by F = P F QF − , (1) n+1 n − n 1 n 1, with initial values F = 0 and F = 1; we denote this sequence by ≥ 0 1 F = [P, Q]. In this paper, we are interested in studying the completeness arXiv:1812.01048v1 [math.NT] 3 Dec 2018 problem for generalized Fibonacci sequences modulo primes. Definition 1. A sequence F ∞ is said to be complete modulo a prime p, { n}n=0 if the map e : N0 Zp = Z/pZ defined by e(n)= Fn + pZ is onto. In other words, the sequence→ is complete modulo p iff k Z n 0 F k (mod p). ∀ ∈ ∃ ≥ n ≡ 1 The study of completeness problem for the Fibonacci sequence (with pa- rameters (1, 1)) began with Shah [8] who showed that the Fibonacci se- − quence is not complete modulo primes p 1, 9 (mod 10).
    [Show full text]
  • Primality Testing : a Review
    Primality Testing : A Review Debdas Paul April 26, 2012 Abstract Primality testing was one of the greatest computational challenges for the the- oretical computer scientists and mathematicians until 2004 when Agrawal, Kayal and Saxena have proved that the problem belongs to complexity class P . This famous algorithm is named after the above three authors and now called The AKS Primality Testing having run time complexity O~(log10:5(n)). Further improvement has been done by Carl Pomerance and H. W. Lenstra Jr. by showing a variant of AKS primality test has running time O~(log7:5(n)). In this review, we discuss the gradual improvements in primality testing methods which lead to the breakthrough. We also discuss further improvements by Pomerance and Lenstra. 1 Introduction \The problem of distinguishing prime numbers from a composite numbers and of resolving the latter into their prime factors is known to be one of the most important and useful in arithmetic. It has engaged the industry and wisdom of ancient and modern geometers to such and extent that its would be superfluous to discuss the problem at length . Further, the dignity of the science itself seems to require that every possible means be explored for the solution of a problem so elegant and so celebrated." - Johann Carl Friedrich Gauss, 1781 A number is a mathematical object which is used to count and measure any quantifiable object. The numbers which are developed to quantify natural objects are called Nat- ural Numbers. For example, 1; 2; 3; 4;::: . Further, we can partition the set of natural 1 numbers into three disjoint sets : f1g, set of fprime numbersg and set of fcomposite numbersg.
    [Show full text]
  • Modular Periodicity of Exponential Sums of Symmetric Boolean Functions and Some of Its Consequences
    MODULAR PERIODICITY OF EXPONENTIAL SUMS OF SYMMETRIC BOOLEAN FUNCTIONS AND SOME OF ITS CONSEQUENCES FRANCIS N. CASTRO AND LUIS A. MEDINA Abstract. This work brings techniques from the theory of recurrent integer sequences to the problem of balancedness of symmetric Booleans functions. In particular, the periodicity modulo p (p odd prime) of exponential sums of symmetric Boolean functions is considered. Periods modulo p, bounds for periods and relations between them are obtained for these exponential sums. The concept of avoiding primes is also introduced. This concept and the bounds presented in this work are used to show that some classes of symmetric Boolean functions are not balanced. In particular, every elementary symmetric Boolean function of degree not a power of 2 and less than 2048 is not balanced. For instance, the elementary symmetric Boolean function in n variables of degree 1292 is not balanced because the prime p = 176129 does not divide its exponential sum for any positive integer n. It is showed that for some symmetric Boolean functions, the set of primes avoided by the sequence of exponential sums contains a subset that has positive density within the set of primes. Finally, in the last section, a brief study for the set of primes that divide some term of the sequence of exponential sums is presented. 1. Introduction Boolean functions are beautiful combinatorial objects with applications to many areas of mathematics as well as outside the field. Some examples include combinatorics, electrical engineering, game theory, the theory of error-correcting codes, and cryptography. In the modern era, efficient implementations of Boolean functions with many variables is a challenging problem due to memory restrictions of current technology.
    [Show full text]
  • On the Parity of the Order of Appearance in the Fibonacci Sequence
    mathematics Article On the Parity of the Order of Appearance in the Fibonacci Sequence Pavel Trojovský Department of Mathematics, Faculty of Science, University of Hradec Králové, 500 03 Hradec Králové, Czech Republic; [email protected]; Tel.: +420-49-333-2860 Abstract: Let (Fn)n≥0 be the Fibonacci sequence. The order of appearance function (in the Fibonacci sequence) z : Z≥1 ! Z≥1 is defined as z(n) := minfk ≥ 1 : Fk ≡ 0 (mod n)g. In this paper, among other things, we prove that z(n) is an even number for almost all positive integers n (i.e., the set of such n has natural density equal to 1). Keywords: order of appearance; Fibonacci numbers; parity; natural density; prime numbers 1. Introduction Let (Fn)n be the sequence of Fibonacci numbers which is defined by the recurrence Fn+2 = Fn+1 + Fn, with initial values F0 = 0 and F1 = 1. For any integer n ≥ 1, the order of apparition (or the rank of appearance) of n (in the Fibonacci sequence), denoted by z(n), is the positive index of the smallest Fibonacci number which is a multiple of n (more precisely, z(n) := minfk ≥ 1 : n j Fkg). The arithmetic function z : Z≥1 ! Z≥1 is well defined (as can be seen in Lucas [1], p. 300) and, in fact, z(n) ≤ 2n is the sharpest upper bound (as can be seen in [2]). A few values of z(n) (for n 2 [1, 50]) can be found in Table1 (see the Citation: Trojovský, P. On the Parity OEIS [3] sequence A001177 and for more facts on properties of z(n) see, e.g., [4–9]).
    [Show full text]
  • Dan Ismailescu Department of Mathematics, Hofstra University, Hempstead, New York [email protected]
    #A65 INTEGERS 14 (2014) ON NUMBERS THAT CANNOT BE EXPRESSED AS A PLUS-MINUS WEIGHTED SUM OF A FIBONACCI NUMBER AND A PRIME Dan Ismailescu Department of Mathematics, Hofstra University, Hempstead, New York [email protected] Peter C. Shim The Pingry School, 131 Martinsville Road, Basking Ridge, New Jersey [email protected] Received: 12/1/13, Revised: 7/31/14, Accepted: 11/19/14, Published: 12/8/14 Abstract In 2012, Lenny Jones proved that there are infinitely many positive integers that th cannot be expressed as Fn p or Fn + p, where Fn is the n term of the Fibonacci sequence and p denotes a prime.− The smallest integer with this property he could find has 950 digits. We prove that the numbers 135225 and 208641 have this property as well. We also show that there are infinitely many integers that cannot be written as Fn p, for any choice of the signs. In particular, 64369395 is such a number. We answ± ±er a question of Jones by showing that there exist infinitely many integers k such that neither k nor k + 1 can be written as Fn p. Finally, we prove that there exist infinitely many perfect squares and infinitely± many perfect cubes that cannot be written as F p. n ± 1. Introduction In 1849, de Polignac [3] conjectured that every odd integer k can be written as the sum of a prime number and a power of 2. It is well known that de Polignac’s conjecture is false. Erd˝os [1] proved that there are infinitely many odd numbers that cannot be written as 2n p where n is a positive integer and p is a prime.
    [Show full text]
  • Properties of a Generalized Arnold's Discrete Cat
    Master’s thesis Properties of a generalized Arnold’s discrete cat map Author: Fredrik Svanström Supervisor: Per-Anders Svensson Examiner: Andrei Khrennikov Date: 2014-06-06 Subject: Mathematics Level: Second level Course code: 4MA11E Department of Mathematics Abstract After reviewing some properties of the two dimensional hyperbolic toral automorphism called Arnold’s discrete cat map, including its gen- eralizations with matrices having positive unit determinant, this thesis contains a definition of a novel cat map where the elements of the matrix are found in the sequence of Pell numbers. This mapping is therefore denoted as Pell’s cat map. The main result of this thesis is a theorem determining the upper bound for the minimal period of Pell’s cat map. From numerical results four conjectures regarding properties of Pell’s cat map are also stated. A brief exposition of some applications of Arnold’s discrete cat map is found in the last part of the thesis. Keywords: Arnold’s discrete cat map, Hyperbolic toral automorphism, Discrete-time dynamical systems, Poincaré recurrence theorem, Number theory, Linear algebra, Fibonacci numbers, Pell numbers, Cryptography. Contents 1 Introduction 1 2 Arnold’s cat map 2 3 The connection between Arnold’s cat and Fibonacci’s rabbits 5 4 Properties of Arnold’s cat map 6 4.1 Periodlengths............................. 6 4.2 Disjointorbits............................. 8 4.3 Higher dimensions of the cat map . 10 4.4 The generalized cat maps with positive unit determinant ..... 11 4.5 Miniatures and ghosts . 12 5 Pell’s cat map 14 5.1 Defining Pell’s cat map . 15 5.2 Some results from elementary number theory .
    [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]