An Exploration of Mathematical Applications in Cryptography

Total Page:16

File Type:pdf, Size:1020Kb

An Exploration of Mathematical Applications in Cryptography AN EXPLORATION OF MATHEMATICAL APPLICATIONS IN CRYPTOGRAPHY THESIS Presented in Partial Fulfillment of the Requirements for the Degree Masters of Mathematical Sciences in the Graduate School of the Ohio State University By Amy Kosek, B.S. in Mathematics Graduate Program in Mathematical Sciences The Ohio State University 2015 Thesis Committee: James Cogdell, Advisor Rodica Costin c Copyright by Amy Kosek 2015 ABSTRACT Modern cryptography relies heavily on concepts from mathematics. In this thesis we will be discussing several cryptographic ciphers and discovering the mathematical applications which can be found by exploring them. This paper is intended to be accessible to undergraduate or graduate students as a supplement to a course in number theory or modern algebra. The structure of the paper also lends itself to be accessible to a person interested in learning about mathematics in cryptography on their own, since we will always give a review of the background material which will be needed before delving into the cryptographic ciphers. ii ACKNOWLEDGMENTS My sincerest thanks to Jim Cogdell for working with me as my advisor for this thesis project. His encouragement and guidance during the last year has meant so much to me, and I am exceedingly grateful for it. Working with him has been a pleasure and an honor. Also, thank you to Rodica Costin for being a member of my thesis committee and my academic advisor. I so appreciate all of the advice and support she has given me during my time at OSU. Lastly, I would like to thank my wonderful husband, Pete Kosek. He has loved and supported me through every part of this process, and I wouldn't be where I am today without him. iii VITA 2013 . B.S. in Mathematics, The College at Brockport, SUNY 2013-Present . Graduate Teaching Associate, The Ohio State University PUBLICATIONS Benjamin D. Sokolowsky, Amy G. VanHooft, Rachel M. Volkert, and Clifford A. Reiter. An Infinite Family of Perfect Parallelepipeds. Mathematics of Computation, 83(289):2441-2454, 2014. FIELDS OF STUDY Major Field: Mathematical Sciences Specialization: Mathematics for Educators iv TABLE OF CONTENTS Abstract . ii Acknowledgments . iii Vita . iv CHAPTER PAGE 1 Introduction . 1 1.1 Motivation . 1 1.2 Public-Key vs. Private-Key Ciphers . 2 2 Number Theory and the RSA Cipher . 5 2.1 Elementary Number Theory . 5 2.2 The RSA Cipher . 13 3 Cryptographic Systems Based on the Discrete Logarithm Problem . 20 3.1 The Discrete Logarithm Problem . 20 3.2 Diffie-Hellman Key Exchange . 25 3.3 ElGamal Cipher . 29 4 Elliptic Curve Cryptography . 34 4.1 Elliptic Curves . 34 4.2 Diffie-Hellman Key Exchange for Elliptic Curves . 41 4.3 ElGamal Cipher for Elliptic Curves . 43 4.4 The Elliptic Curve Digital Signature Algorithm . 45 Bibliography . 49 v CHAPTER 1 INTRODUCTION 1.1 Motivation In cryptography people design systems which can be used for protecting data. A cryptographic cipher can be used to encrypt information so that it cannot be read except by the person who can decrypt it. It is as if you put the message which you want safe into a box with a lock on it; that way only someone with the key to the lock can read the message. Information security is an extremely important and relevant problem in the world, particularly in this day and age in which so much of our communication occurs over the internet. Think about the last time you paid for something online with your credit card. Did you trust that your card information was safe and that it couldn't be stolen by someone intercepting it? It most likely was safe, and that was most likely thanks to cryptography! Modern cryptography relies heavily on concepts from number theory. We are going to learn several different cryptographic ciphers and focus on what types of mathematical concepts we can find by exploring them. Chapters 2 and 3 should be very accessible to anyone who is familiar with elementary number theory or group theory. In each of those chapters, we will do a brief refresher of the main mathe- matical concepts which we will use before we jump into learning the cryptographic ciphers. Chapter 4 will look into the study of elliptic curves and their applications to 1 cryptography. In that chapter we will give an introduction to elliptic curves before studying the way they can be used in cryptographic ciphers. So you do not need to have any prior exposure to elliptic curves to be able to study that section. It may be helpful, however, to have some familiarity with finite fields in order to easily understand the theory of elliptic curves which we will discuss. 1.2 Public-Key vs. Private-Key Ciphers The main purpose of both public-key and private-key cryptographic ciphers is to be able to send important or sensitive messages and information from party to party in such a way that it cannot be intercepted or tampered with. Some examples could be communicating military plans or banks sending information about money transfers. Public-key and private-key ciphers provide two techniques for this. In each of these types of ciphers we will discuss encryption keys and decryption keys. The encryption key is what will be used to encode the message from \plaintext" into \ciphertext", whereas the decryption key is what will be used to decode the ciphertext back into the plaintext message [1]. In a private-key cipher (also known as a symmetric cipher) knowledge of the encryption key is equivalent to knowledge of the decryption key. A simple example of this is Caesar's Cipher, which is a very simple shift cipher. To do this you take each letter in your message and replace it with a different letter which is a fixed number of places further in the alphabet. For example you could replace A with E, B with F, C with G, etc. To decrypt the message you simply reverse shift the letters the same fixed amount you used in the encryption. So anyone who knows how the message was encrypted could decrypt it. Currently used symmetric ciphers are far more complicated and provide far more security than Caesar's Cipher. The main idea to grasp at this point, however, is that in a private-key cipher both the 2 encryption key and decryption key must be kept secret from those who are not a part of the communications at hand in order to ensure the cipher's security. Because of this encryption/decryption keys must be generated for pairs of people each time they wish to communicate. One thing to note is that because the encryption key and decryption key for a symmetric cipher are essentially equivalent we will sometimes only refer to the cipher having a single key. In contrast, public-key ciphers (also known as asymmetric ciphers) are devel- oped in such a way that knowledge of the encryption key gives no information as to what the decryption key is (at least not in any reasonable amount of computing time). A way in which public-key ciphers are developed is by making use of a mathematical problem which is \easy" in one direction, but “difficult” in the other direction. For example, the RSA Cipher which we will discuss in the next chapter uses the notion that multiplying two large primes together, each on the order of 1080 or larger, is relatively easy in a computational sense, versus trying to factor a large number, say on the order of 10160 or larger, into its prime factors, which is seemingly impossible to do in any realistic amount of time. This may not make perfect sense now, but as we move on to the sections describing the various public-key ciphers we will explain how it works in greater detail. The benefit of a public-key cipher is that one person, say Bob, could use it to set up an encryption key which he then makes public and keeps his decryption key private to himself. Now several parties could look up Bob's encryption key and send him a message which only he will be able to decrypt. This reduces the number of keys needed to be generated and remembered tremendously. A disadvantage of public-key ciphers is that they are much more computationally costly than symmetric ciphers. A common method which is used in cryptography is to use a public-key cipher in order to encrypt and send a shared private-key which can 3 then be used for communication using a faster running symmetric cipher. This shared private-key will be used for a single session of communication and then discarded after that session is finished. 4 CHAPTER 2 NUMBER THEORY AND THE RSA CIPHER 2.1 Elementary Number Theory In this section we will be outlining several topics from number theory which we will need in order to explore the mathematics behind the cryptographic cipher known as the RSA Cipher. The RSA Cipher is a wonderful example of a real world application of the theoretical topics learned in elementary number theory. As you read through this section you will find that we have omitted much of the material surrounding the definitions and theorems given, and instead trimmed it down into just the basics which we will need to recall when we learn the RSA cipher. If you need a more in depth explanation of any of these topics there are several wonderful resources such as [3] and [7] referenced at the conclusion of this paper. Definition 2.1.1. Suppose we have two integers a and b with a 6= 0.
Recommended publications
  • Simultaneous Elements of Prescribed Multiplicative Orders 2
    Simultaneous Elements Of Prescribed Multiplicative Orders N. A. Carella Abstract: Let u 6= ±1, and v 6= ±1 be a pair of fixed relatively prime squarefree integers, and let d ≥ 1, and e ≥ 1 be a pair of fixed integers. It is shown that there are infinitely many primes p ≥ 2 such that u and v have simultaneous prescribed multiplicative orders ordp u = (p − 1)/d and ordp v = (p − 1)/e respectively, unconditionally. In particular, a squarefree odd integer u > 2 and v = 2 are simultaneous primitive roots and quadratic residues (or quadratic nonresidues) modulo p for infinitely many primes p, unconditionally. Contents 1 Introduction 1 2 Divisors Free Characteristic Function 4 3 Finite Summation Kernels 5 4 Gaussian Sums, And Weil Sums 7 5 Incomplete And Complete Exponential Sums 7 6 Explicit Exponential Sums 11 7 Equivalent Exponential Sums 12 8 Double Exponential Sums 13 9 The Main Term 14 10 The Error Terms 15 arXiv:2103.04822v1 [math.GM] 5 Mar 2021 11 Simultaneous Prescribed Multiplicative Orders 16 12 Probabilistic Results For Simultaneous Orders 18 1 Introduction The earliest study of admissible integers k-tuples u1, u2, . , uk ∈ Z of simultaneous prim- itive roots modulo a prime p seems to be the conditional result in [21]. Much more general March 9, 2021 AMS MSC2020 :Primary 11A07; Secondary 11N13 Keywords: Distribution of primes; Primes in arithmetic progressions; Simultaneous primitive roots; Simul- taneous prescribed orders; Schinzel-Wojcik problem. 1 Simultaneous Elements Of Prescribed Multiplicative Orders 2 results for admissible rationals k-tuples u1, u2, . , uk ∈ Q of simultaneous elements of independent (or pseudo independent) multiplicative orders modulo a prime p ≥ 2 are considered in [26], and [14].
    [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]
  • Computing Multiplicative Order and Primitive Root in Finite Cyclic Group
    Computing Multiplicative Order and Primitive Root in Finite Cyclic Group Shri Prakash Dwivedi ∗ Abstract Multiplicative order of an element a of group G is the least positive integer n such that an = e, where e is the identity element of G. If the order of an element is equal to |G|, it is called generator or primitive root. This paper describes the algorithms for computing multiplicative order and Z∗ primitive root in p, we also present a logarithmic improvement over classical algorithms. 1 Introduction Algorithms for computing multiplicative order or simply order and primitive root or generator are important in the area of random number generation and discrete logarithm problem among oth- Z∗ ers. In this paper we consider the problem of computing the order of an element over p, which is Z∗ multiplicative group modulo p . As stated above order of an element a ∈ p is the least positive integer n such that an = 1. In number theoretic language, we say that the order of a modulo m is n, if n is the smallest positive integer such that an ≡ 1( mod m). We also consider the related Z∗ Z∗ problem of computing the primitive root in p. If order of an element a ∈ n usually denoted as Z∗ ordn(a) is equal to | n| i.e. order of multiplicative group modulo n, then a is called called primi- Z∗ tive root or primitive element or generator [3] of n. It is called generator because every element Z∗ in n is some power of a. Efficient deterministic algorithms for both of the above problems are not known yet.
    [Show full text]
  • Arxiv:Math/0412262V2 [Math.NT] 8 Aug 2012 Etrgae Tgte Ihm)O Atnscnetr and Conjecture fie ‘Artin’S Number on of Cojoc Me) Domains’
    ARTIN’S PRIMITIVE ROOT CONJECTURE - a survey - PIETER MOREE (with contributions by A.C. Cojocaru, W. Gajda and H. Graves) To the memory of John L. Selfridge (1927-2010) Abstract. One of the first concepts one meets in elementary number theory is that of the multiplicative order. We give a survey of the lit- erature on this topic emphasizing the Artin primitive root conjecture (1927). The first part of the survey is intended for a rather general audience and rather colloquial, whereas the second part is intended for number theorists and ends with several open problems. The contribu- tions in the survey on ‘elliptic Artin’ are due to Alina Cojocaru. Woj- ciec Gajda wrote a section on ‘Artin for K-theory of number fields’, and Hester Graves (together with me) on ‘Artin’s conjecture and Euclidean domains’. Contents 1. Introduction 2 2. Naive heuristic approach 5 3. Algebraic number theory 5 3.1. Analytic algebraic number theory 6 4. Artin’s heuristic approach 8 5. Modified heuristic approach (`ala Artin) 9 6. Hooley’s work 10 6.1. Unconditional results 12 7. Probabilistic model 13 8. The indicator function 17 arXiv:math/0412262v2 [math.NT] 8 Aug 2012 8.1. The indicator function and probabilistic models 17 8.2. The indicator function in the function field setting 18 9. Some variations of Artin’s problem 20 9.1. Elliptic Artin (by A.C. Cojocaru) 20 9.2. Even order 22 9.3. Order in a prescribed arithmetic progression 24 9.4. Divisors of second order recurrences 25 9.5. Lenstra’s work 29 9.6.
    [Show full text]
  • A Quantum Primality Test with Order Finding
    A quantum primality test with order finding Alvaro Donis-Vela1 and Juan Carlos Garcia-Escartin1,2, ∗ 1Universidad de Valladolid, G-FOR: Research Group on Photonics, Quantum Information and Radiation and Scattering of Electromagnetic Waves. o 2Universidad de Valladolid, Dpto. Teor´ıa de la Se˜nal e Ing. Telem´atica, Paseo Bel´en n 15, 47011 Valladolid, Spain (Dated: November 8, 2017) Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat’s theorem. For an integer N, the test tries to find an element of the multiplicative group of integers modulo N with order N − 1. If one is found, the number is known to be prime. During the test, we can also show most of the times N is composite with certainty (and a witness) or, after log log N unsuccessful attempts to find an element of order N − 1, declare it composite with high probability. The algorithm requires O((log n)2n3) operations for a number N with n bits, which can be reduced to O(log log n(log n)3n2) operations in the asymptotic limit if we use fast multiplication. Prime numbers are the fundamental entity in number For a prime N, ϕ(N) = N 1 and we recover Fermat’s theory and play a key role in many of its applications theorem. − such as cryptography. Primality tests are algorithms that If we can find an integer a for which aN−1 1 mod N, determine whether a given integer N is prime or not.
    [Show full text]
  • Exponential and Character Sums with Mersenne Numbers
    Exponential and character sums with Mersenne numbers William D. Banks Dept. of Mathematics, University of Missouri Columbia, MO 65211, USA [email protected] John B. Friedlander Dept. of Mathematics, University of Toronto Toronto, Ontario M5S 3G3, Canada [email protected] Moubariz Z. Garaev Instituto de Matem´aticas Universidad Nacional Aut´onoma de M´exico C.P. 58089, Morelia, Michoac´an, M´exico [email protected] Igor E. Shparlinski Dept. of Computing, Macquarie University Sydney, NSW 2109, Australia [email protected] Dedicated to the memory of Alf van der Poorten 1 Abstract We give new bounds on sums of the form Λ(n) exp(2πiagn/m) and Λ(n)χ(gn + a), 6 6 nXN nXN where Λ is the von Mangoldt function, m is a natural number, a and g are integers coprime to m, and χ is a multiplicative character modulo m. In particular, our results yield bounds on the sums exp(2πiaMp/m) and χ(Mp) 6 6 pXN pXN p with Mersenne numbers Mp = 2 − 1, where p is prime. AMS Subject Classification Numbers: 11L07, 11L20. 1 Introduction Let m be an arbitrary natural number, and let a and g be integers that are coprime to m. Our aim in the present note is to give bounds on exponential sums and multiplicative character sums of the form n n Sm(a; N)= Λ(n)em(ag ) and Tm(χ, a; N)= Λ(n)χ(g + a), 6 6 nXN nXN where em is the additive character modulo m defined by em(x) = exp(2πix/m) (x ∈ R), and χ is a nontrivial multiplicative character modulo m.
    [Show full text]
  • Overpseudoprimes, Mersenne Numbers and Wieferich Primes 2
    OVERPSEUDOPRIMES, MERSENNE NUMBERS AND WIEFERICH PRIMES VLADIMIR SHEVELEV Abstract. We introduce a new class of pseudoprimes - so-called “overpseu- doprimes” which is a special subclass of super-Poulet pseudoprimes. De- noting via h(n) the multiplicative order of 2 modulo n, we show that odd number n is overpseudoprime if and only if the value of h(n) is invariant of all divisors d > 1 of n. In particular, we prove that all composite Mersenne numbers 2p − 1, where p is prime, and squares of Wieferich primes are overpseudoprimes. 1. Introduction n Sometimes the numbers Mn =2 − 1, n =1, 2,..., are called Mersenne numbers, although this name is usually reserved for numbers of the form p (1) Mp =2 − 1 where p is prime. In our paper we use the latter name. In this form numbers Mp at the first time were studied by Marin Mersenne (1588-1648) at least in 1644 (see in [1, p.9] and a large bibliography there). We start with the following simple observation. Let n be odd and h(n) denote the multiplicative order of 2 modulo n. arXiv:0806.3412v9 [math.NT] 15 Mar 2012 Theorem 1. Odd d> 1 is a divisor of Mp if and only if h(d)= p. Proof. If d > 1 is a divisor of 2p − 1, then h(d) divides prime p. But h(d) > 1. Thus, h(d)= p. The converse statement is evident. Remark 1. This observation for prime divisors of Mp belongs to Max Alek- seyev ( see his comment to sequence A122094 in [5]).
    [Show full text]
  • Introduction to Abstract Algebra “Rings First”
    Introduction to Abstract Algebra \Rings First" Bruno Benedetti University of Miami January 2020 Abstract The main purpose of these notes is to understand what Z; Q; R; C are, as well as their polynomial rings. Contents 0 Preliminaries 4 0.1 Injective and Surjective Functions..........................4 0.2 Natural numbers, induction, and Euclid's theorem.................6 0.3 The Euclidean Algorithm and Diophantine Equations............... 12 0.4 From Z and Q to R: The need for geometry..................... 18 0.5 Modular Arithmetics and Divisibility Criteria.................... 23 0.6 *Fermat's little theorem and decimal representation................ 28 0.7 Exercises........................................ 31 1 C-Rings, Fields and Domains 33 1.1 Invertible elements and Fields............................. 34 1.2 Zerodivisors and Domains............................... 36 1.3 Nilpotent elements and reduced C-rings....................... 39 1.4 *Gaussian Integers................................... 39 1.5 Exercises........................................ 41 2 Polynomials 43 2.1 Degree of a polynomial................................. 44 2.2 Euclidean division................................... 46 2.3 Complex conjugation.................................. 50 2.4 Symmetric Polynomials................................ 52 2.5 Exercises........................................ 56 3 Subrings, Homomorphisms, Ideals 57 3.1 Subrings......................................... 57 3.2 Homomorphisms.................................... 58 3.3 Ideals.........................................
    [Show full text]
  • MAS330 FULL NOTES Week 1. Euclidean Algorithm, Linear
    MAS330 FULL NOTES Week 1. Euclidean Algorithm, Linear congruences, Chinese Remainder Theorem Elementary Number Theory studies modular arithmetic (i.e. counting modulo an integer n), primes, integers and equations. This week we review modular arithmetic and Euclidean algorithm. 1. Introduction 1.1. What is Number Theory? Not trying to answer this directly, let us mention some typical questions we will deal with in this course. Q. What is the last decimal digit of 31000? A. The last decimal digit of 31000 is 1. This is a simple computation we'll do using Euler's Theorem in Week 4. Q. Is there a formula for prime numbers? A. We don't know if any such formula exists. P. Fermat thought that all numbers of the form 2n Fn = 2 + 1 are prime, but he was mistaken! We study Fermat primes Fn in Week 6. Q. Are there any positive integers (x; y; z) satisfying x2 + y2 = z2? A. There are plenty of solutions of x2 + y2 = z2, e.g. (x; y; z) = (3; 4; 5); (5; 12; 13). In fact, there are infinitely many of them. Ancient Greeks have written the formula for all the solutions! We'll discover this formula in Week 8. Q. How about xn + yn = zn for n ≥ 3? A. There are no solutions of xn + yn = zn in positive integers! This fact is called Fermat's Last Theorem and we discuss it in Week 8. Q. Which terms of the Fibonacci sequence un = f1; 1; 2; 3; 5; 8; 13; 21; 34; 55; 89; 144; 233;::: g are divisible by 3? A.
    [Show full text]
  • Cyclic Groups and Primitive Roots
    Cyclic Groups and Primitive Roots Ryan C. Daileda Trinity University Number Theory Daileda Primitive Roots Cyclic Subgroups Let G be a group and let a ∈ G. The set hai = {am | m ∈ Z} is clearly closed under multiplication and inversion in G. hai is therefore a group in its own right, the cyclic subgroup generated by a. Our work last time immediately proves: Theorem 1 Let G be a group and let a ∈ G. If |a| is infinite, so is hai. If |a| = n ∈ N, then hai = {e, a, a2,..., an−1}, and these elements are all distinct. Daileda Primitive Roots Examples The (additive) subgroup of Z/20Z generated by 12 + 20Z is {12 + 20Z, 4 + 20Z, 16 + 20Z, 8 + 20Z, 0 + 20Z}, 20 which has 5 = (12,20) elements, as expected. The (multiplicative) subgroup of (Z/16Z)× generated by 3 + 16Z is {3 + 16Z, 9 + 16Z, 11 + 16Z, 1 + 16Z}, which has 4 = |3 + 16Z| elements. Daileda Primitive Roots Cyclic Groups Definition A group G is called cyclic if there is an a ∈ G so that G = hai. In this case we say that G is generated by a. Since |a| = hai , if G is finite we find that G is cyclic ⇔ G has an element of order |G|. Since the additive order of 1+ nZ in Z/nZ is exactly n, we conclude that Z/nZ (under addition) is always cyclic. Daileda Primitive Roots n Recall that the additive order of a + nZ in Z/nZ is (a,n) . Thus: The (additive) generators of Z/nZ are the elements of (Z/nZ)×.
    [Show full text]
  • Introduction to Number Theory
    Introduction to Number Theory INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: ℕ={0 ,1, 2,} . Integers: ℤ={0 ,±1,±2,} . Definition: Divisor ∣ If a∈ℤ can be writeen as a=bc where b , c∈ℤ , then we say a is divisible by b or, b divides a (denoted b a ), or b is a divisor of a . Definition: Prime We call a number p≥2 prime if its only positive divisors are 1 and p . Definition: Congruent ∣ − If d ≥2 , d ∈ℕ , we say integers a and b are congruent modulo d if d a b and write it a≡bmod d . Examples of Number Theory Questions 1. What are the solutions to a 2b2 =c2 ? s2 −t 2 s2 t 2 Answer: a=s t , b= , c= . 2 2 2. Fundamental Theorem of Arithmetic. Each integer can be written as a product of primes; moreover, the representation is unique up to the order of factors. 3. Theorem (Euclid). There are infinitely many prime numbers. 4. Suppose a , b=1 , i.e. a and d have no common divisors except 1. Are there infinitely many primes ≡ p a mod d ? Equivalently, are there infinitely many prime values of the linear polynomial dxa , x∈ℤ ? Answer: Yes (Dirichlet, 1837). 5. Are there infinitely many primes of the form p=x 21, x∈ℤ ? Not known, expect yes. It is known that there are infinitely many numbers n=x 21 such that n is either prime or has 2 prime factors. 2 2 = ≡ 6. What primes can be written as p=a b ? Answer: If p 2 or p 1 mod 4 .
    [Show full text]
  • 2Y, X > 0, Y ≥ 0 1. Scope We Consider the Number of Ways to Repr
    THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x2 − 2y, x > 0, y ≥ 0 RICHARD J. MATHAR Abstract. We count solutions to the Ramanujan-Nagell equation 2y +n = x2 for fixed positive n. The computational strategy is to count the solutions separately for even and odd exponents y, and to handle the odd case with modular residues for most cases of n. 1. Scope We consider the number of ways to represent n > 0 as (1) n = x2 − 2y; for pairs of the non-negative unknowns x and y. Equivalently we count the y such that (2) n + 2y = x2 are perfect squares. Remark 1. For n = 0 the number of solutions is infinite because each even value of y creates one solution. The n for which the count is nonzero end up in [8, A051204]. Remark 2. Negative n for which solutions exists are listed in [8, A051213] [4,2] . The solutions are counted separately for even y and odd y and added up. The total count is at most 4 [6]. 2. Even Exponents y Counting the squares x2 of the format (2) considering only even y is basically a matter of considering the values y = 0; 2; 4;::: in turn and checking explicitly each y2 + n against being a square. An upper limit to the y is determined as follows: • The y-values in the range 2y < n are all checked individually. • For larger y the values of 2y + n on the left hand side of (2) are represented in binary by some most significant bit contributed by 2y and|after a train of zero bits depending of how much larger 2y is than n|the trailing bits of n.
    [Show full text]