DOCSLIB.ORG

Notes for Number Theory Here Are the Notes I Wrote up for a Number Theory Course I Taught

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Notes for Number Theory Here Are the Notes I Wrote up for a Number Theory Course I Taught 1 Notes for Number Theory Here are the notes I wrote up for a number theory course I taught. The notes cover elementary number theory but don’t get into anything too advanced. My approach to things is fairly informal. I like to explain the ideas behind everything without getting too formal and also without getting too wordy. If you see anything wrong (including typos), please send me a note at [email protected]. Last updated: March 20, 2021. Contents 1 Divisibility 4 1.1 Definition of divisibility...............................................4 1.2 The division algorithm................................................5 1.3 The modulo operation................................................7 1.4 The greatest common divisor............................................7 1.5 Gcds and linear combinations...........................................9 1.6 The extended Euclidean algorithm........................................9 1.7 A few example proofs................................................ 11 1.8 The least common multiple............................................. 11 1.9 Relatively prime integers.............................................. 12 1.10 The gcd and lcm of more than two integers................................... 13 1.11 Some useful facts about divisibility and gcds.................................. 13 2 Primes 15 2.1 The fundamental theorem of arithmetic..................................... 15 2.2 There are infinitely many primes.......................................... 17 2.3 Finding primes..................................................... 17 2.4 The prime number theorem............................................. 18 2.5 Twin primes...................................................... 19 2.6 Prime gaps....................................................... 19 2.7 Finding large primes................................................. 19 2.8 Prime-generating formulas............................................. 20 2.9 Primes and arithmetic progressions........................................ 22 2.10 Fermat numbers.................................................... 22 2.11 Sophie Germain primes............................................... 22 2.12 Goldbach’s conjecture................................................ 22 2.13 Some sums....................................................... 23 2.14 The Riemann hypothesis............................................... 24 2.15 Number-theoretic functions............................................. 25 3 Modular arithmetic 29 3.1 Working with congruences............................................. 30 2 CONTENTS 3 3.2 Powers.......................................................... 32 3.3 Some further examples of modular arithmetic................................. 34 3.4 Fermat’s little theorem................................................ 34 3.5 Euler’s theorem.................................................... 36 3.6 Formal definition and inverses........................................... 36 3.7 Wilson’s theorem................................................... 37 3.8 Solving congruences................................................. 38 3.9 Solving linear Diophantine equations....................................... 40 3.10 The Chinese remainder theorem.......................................... 42 3.11 Order.......................................................... 44 3.12 Primitive roots..................................................... 45 3.13 Decimal expansions.................................................. 47 3.14 Quadratic Reciprocity................................................ 48 4 Cryptography 54 4.1 Diffie-Hellman key exchange............................................ 54 4.2 RSA cryptography................................................... 55 4.3 Elliptic curve cryptography............................................. 57 5 Special numbers 60 5.1 Perfect numbers and Mersenne primes...................................... 60 5.2 Pythagorean triples.................................................. 62 6 Primality testing and factoring 64 6.1 Primality testing.................................................... 64 6.2 Factoring........................................................ 66 Chapter 1 Divisibility 1.1 Definition of divisibility One of the most basic concepts in number theory is that of divisibility. The concept is familiar: 14 is divisible by 7, even numbers are divisible by 2, prime numbers are only divisible by themselves and 1, etc. Here is the formal definition: Definition 1. An integer d is a divisor of an integer n if there exists an integer k such that n = dk. We say that n is divisible by d, or that d divides n, and write d n. j For example, 20 is divisible by 4 because we can write 20 = 4 5; that is n = dk, with n = 20, d = 4, and k = 5. The equation n = dk is the key part of the definition. It gives us· a formula that we can associate with the concept of divisibility. This formula is handy when it comes to proving things involving divisibility. If we are given that n is divisible by d, then we write that in equation form as n = dk for some integer k. If we need to show that n is divisible by d, then we need to find some integer k such that n = dk. Here are a few example proofs: 1. Suppose we want to prove the simple fact that if n is even, then n2 is even as well. 2 2 2 Proof. Even numbers are divisible by 2, so we can write n = 2k for some integer k. Then n = (2k) = 4k , 2 2 2 2 which we can write as n = 2(2k ). We have written n as 2 times some integer, so we see that n is divisible by 2 (and hence even). 2. Prove that if a b and b c, then a c j j j 2 Proof. Since a b and b c we can write b = a j and c = bk for some integers j and k. Plug the first equation into the secondj to get cj = (a j)k, which we can rewrite as c = a(jk). So we see that a c, since we have written c as a multiple of a. j 3. Prove that if a b, then ac bc, for any integer c. j j Proof. Since a b, we can write b = ak for some integer k. Multiply both sides of this equation by c to get (ac)k = bc. Thisj equation tells us that ac bc, which is what we want. j 2Note that we must use different integers here since the integer j that works for a b does not necessarily equal the integer k that works for b c. j j 4 CHAPTER 1. DIVISIBILITY 5 Here are a couple of other divisibility examples: 1. Disprove: If a (b + c), then a b or a c. j j j Solution. All we need is a single counterexample. Setting a = 5, b = 3, and c = 7 does the trick. 2. Find a divisor of 359951 besides 1 and itself. Solution. The only answers are 593 and 607. It would be tedious to find them by checking divisors starting 2 2 with 2, 3, etc. A better way is to use the algebraic fact x y = (x y)(x + y). This fact is very useful in number theory. − − With a little cleverness, we might notice that 359951 is 360000 49, which is 6002 72. We can factor this into (600 7)(600 + 7), or 593 607. − − − × 1.2 The division algorithm The division algorithm, despite its name, it is not really an algorithm. It states that when you divide two numbers, there is a unique quotient and remainder. Specifically, it says the following: Theorem 1. Let a, b Z with b > 0. Then there exist unique q, r Z such that a = bq + r and 0 r < b. 2 2 ≤ The integers q and r are called the quotient and remainder. For example, if a = 27 and b = 7, then q = 3 and r = 6. That is, 27 7 is 3 with a remainder of 6, or in equation form: 27 = 7 3 + 6. The proof of the theorem is not difficult and can÷ be found in number theory textbooks. · One of the keys here is that the remainder is less than b. Here are some consequences of the theorem: 1 • Taking b = 2, tells us all integers are of the form 2k or 2k + 1 (i.e., every integer is either odd or even). • Taking b = 3, all integers are of the form 3k, 3k + 1, or 3k + 2. • Taking b = 4, all integers are of the form 4k, 4k + 1, 4k + 2, or 4k + 3. • For a general b, all integers are of the form bk, bk + 1, . , or bk + (b 1). − These are useful for breaking things up into cases. Here are a few examples: 3 1. Suppose we want to show that n n is always divisible by 3. We can break things up into cases n = 3k, n = 3k + 1, and n = 3k + 2, like below:− 3 3 3 n = 3k : (3k) 3k = 27k 3k = 3(9k k), − 3 − 3 −2 3 n = 3k + 1 : (3k + 1) (3k + 1) = 27k + 9k + 3k + 1 3k 1 = 3(9k 3k), 3 − 3 2 − − −3 2 n = 3k + 2 : (3k + 2) (3k + 2) = 27k + 18k + 12k + 8 3k 2 = 3(9k + 6k + 3k + 2). − − − We see that in each case, n3 n is divisible by 3. By the division algorithm, these are the only cases we need to check, since every integer− must be of one of those three forms. 2. Prove that every perfect square is of the form 4k or 4k + 1. Proof. Every integer n is of the form 2k or 2k + 1. 2 2 2 If n = 2k, then we have n = 4k , which is of the form 4k. 2 2 2 If n = 2j + 1, then we have n = 4k + 4k + 1 = 4(k + k) + 1, which is of the form 4k + 1. 1We use k instead of q here out of convention. 2We are being a bit informal here with the notation. When we say the number is of the form 4k, the k is different from the k used in n = 2k. What we’re really saying here is that the number is of the form 4 times some integer. A more rigorous way to approach this might be 2 2 2 2 to let n = 2j, compute n = 4j and say n = 4k, with k = j . CHAPTER 1. DIVISIBILITY 6 3. A prime number is a number greater than 1 whose only divisors are 1 and itself. Prove that every prime greater than 3 is of the form 6k + 1 or 6k + 5. Proof. Every integer is of the form 6k, 6k + 1, 6k + 2, 6k + 3, 6k + 4, or 6k + 5. An integer of form 6k is divisible by 6. A integer of the form 6k + 2 is divisible by 2 as it can be written as 2(3k + 1). Similarly, an integer of the form 6k + 3 is divisible by 3 and an integer of the form 6k + 4 is divisible by 2. None of these forms can be prime (except for the integers 2 and 3, which we exclude), so the only forms left that could be prime are 6k + 1 and 6k + 5.
Load more

Recommended publications
  • An Amazing Prime Heuristic.Pdf
    This document has been moved to https://arxiv.org/abs/2103.04483 Please use that version instead. AN AMAZING PRIME HEURISTIC CHRIS K. CALDWELL 1. Introduction The record for the largest known twin prime is constantly changing. For example, in October of 2000, David Underbakke found the record primes: 83475759 264955 1: · The very next day Giovanni La Barbera found the new record primes: 1693965 266443 1: · The fact that the size of these records are close is no coincidence! Before we seek a record like this, we usually try to estimate how long the search might take, and use this information to determine our search parameters. To do this we need to know how common twin primes are. It has been conjectured that the number of twin primes less than or equal to N is asymptotic to N dx 2C2N 2C2 2 2 Z2 (log x) ∼ (log N) where C2, called the twin prime constant, is approximately 0:6601618. Using this we can estimate how many numbers we will need to try before we find a prime. In the case of Underbakke and La Barbera, they were both using the same sieving software (NewPGen1 by Paul Jobling) and the same primality proving software (Proth.exe2 by Yves Gallot) on similar hardware{so of course they choose similar ranges to search. But where does this conjecture come from? In this chapter we will discuss a general method to form conjectures similar to the twin prime conjecture above. We will then apply it to a number of different forms of primes such as Sophie Germain primes, primes in arithmetic progressions, primorial primes and even the Goldbach conjecture.
    [Show full text]
  • Prime Numbers in Logarithmic Intervals
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by PORTO Publications Open Repository TOrino Prime numbers in logarithmic intervals Danilo Bazzanella Dipartimento di Matematica, Politecnico di Torino, Italy [email protected] Alessandro Languasco Dipartimento di Matematica Pura e Applicata Universit`adi Padova , Italy [email protected] Alessandro Zaccagnini Dipartimento di Matematica Universit`adi Parma, Italy [email protected] First published in Transactions of the American Mathematical Society 362 (2010), no. 5, 2667-2684 published by the American Mathematical Society DOI: 10.1090/S0002-9947-09-05009-0 The original publication is available at http://www.ams.org/ 1 TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 362, Number 5, May 2010, Pages 2667–2684 S0002-9947(09)05009-0 Article electronically published on November 17, 2009 PRIME NUMBERS IN LOGARITHMIC INTERVALS DANILO BAZZANELLA, ALESSANDRO LANGUASCO, AND ALESSANDRO ZACCAGNINI Abstract. Let X be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type (p, p + h], where p X is a prime number and h = o(X). Then we will apply this to prove that ≤ for every λ>1/2thereexistsapositiveproportionofprimesp X such that ≤ the interval (p, p+λ log X]containsatleastaprimenumber.Asaconsequence we improve Cheer and Goldston’s result on the size of real numbers λ> 1 with the property that there is a positive proportion of integers m X ≤ such that the interval
    [Show full text]
  • Multiplication Modulo N Along the Primorials with Its Differences And
    Multiplication Modulo n Along The Primorials With Its Differences And Variations Applied To The Study Of The Distributions Of Prime Number Gaps A.K.A. Introduction To The S Model Russell Letkeman r. letkeman@ gmail. com Dedicated to my son Panha May 19, 2013 Abstract The sequence of sets of Zn on multiplication where n is a primorial gives us a surprisingly simple and elegant tool to investigate many properties of the prime numbers and their distributions through analysis of their gaps. A natural reason to study multiplication on these boundaries is a construction exists which evolves these sets from one primorial boundary to the next, via the sieve of Eratosthenes, giving us Just In Time prime sieving. To this we add a parallel study of gap sets of various lengths and their evolution all of which together informs what we call the S model. We show by construction there exists for each prime number P a local finite probability distribution and it is surprisingly well behaved. That is we show the vacuum; ie the gaps, has deep structure. We use this framework to prove conjectured distributional properties of the prime numbers by Legendre, Hardy and Littlewood and others. We also demonstrate a novel proof of the Green-Tao theorem. Furthermore we prove the Riemann hypoth- esis and show the results are perhaps surprising. We go on to use the S model to predict novel structure within the prime gaps which leads to a new Chebyshev type bias we honorifically name the Chebyshev gap bias. We also probe deeper behavior of the distribution of prime numbers via ultra long scale oscillations about the scale of numbers known as Skewes numbers∗.
    [Show full text]
  • Primes Counting Methods: Twin Primes 1. Introduction
    Primes Counting Methods: Twin Primes N. A. Carella, July 2012. Abstract: The cardinality of the subset of twin primes { p and p + 2 are primes } is widely believed to be an infinite subset of prime numbers. This work proposes a proof of this primes counting problem based on an elementary weighted sieve. Mathematics Subject Classifications: 11A41, 11N05, 11N25, 11G05. Keywords: Primes, Distribution of Primes, Twin Primes Conjecture, dePolignac Conjecture, Elliptic Twin Primes Conjecture, Prime Diophantine Equations. 1. Introduction The problem of determining the cardinality of the subset of primes { p = f (n) : p is prime and n !1 }, defined by a function f : ℕ → ℕ, as either finite or infinite is vastly simpler than the problem of determining the primes counting function of the subset of primes (x) # p f (n) x : p is prime and n 1 " f = { = # $ } The cardinality of the simplest case of the set of all primes P = { 2, 3, 5, … } was settled by Euclid over two millennia ago, see [EU]. After that event,! many other proofs have been discovered by other authors, see [RN, Chapter 1], and the literature. In contrast, the determination of the primes counting function of the set of all primes is still incomplete. Indeed, the current asymptotic formula (25) of the " (x) = #{ p # x : p is prime } primes counting function, also known as the Prime Number Theorem, is essentially the same as determined by delaVallee Poussin, and Hadamard. ! The twin primes conjecture claims that the Diophantine equation q = p + 2 has infinitely many prime pairs solutions. More generally, the dePolignac conjecture claims that for any fixed k ≥ 1, the Diophantine equation q = p + 2k has infinitely many prime pairs solutions, confer [RN, p.
    [Show full text]
  • New Bounds and Computations on Prime-Indexed Primes Jonathan Bayless Husson University
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by ScholarWorks at Central Washington University Central Washington University ScholarWorks@CWU Mathematics Faculty Scholarship College of the Sciences 2013 New Bounds and Computations on Prime-Indexed Primes Jonathan Bayless Husson University Dominic Klyve Central Washington University, [email protected] Tomas Oliveira e Silva Universidade de Aveiro Follow this and additional works at: http://digitalcommons.cwu.edu/math Part of the Mathematics Commons Recommended Citation Bayless, J., Klyve, D. & Oliveira e Silva, T. (2013). New bounds and computations on prime-indexed primes. Integers 13(A43), 1-21. This Article is brought to you for free and open access by the College of the Sciences at ScholarWorks@CWU. It has been accepted for inclusion in Mathematics Faculty Scholarship by an authorized administrator of ScholarWorks@CWU. #A43 INTEGERS 13 (2013) NEW BOUNDS AND COMPUTATIONS ON PRIME-INDEXED PRIMES Jonathan Bayless Department of Mathematics, Husson University, Bangor, Maine [email protected] Dominic Klyve Dept. of Mathematics, Central Washington University, Ellensburg, Washington [email protected] Tom´as Oliveira e Silva Electronics, Telecommunications, and Informatics Department, Universidade de Aveiro, Aveiro, Portugal [email protected] Received: 5/25/12, Revised: 5/15/13, Accepted: 5/16/13, Published: 7/10/13 Abstract In a 2009 article, Barnett and Broughan considered the set of prime-index primes. If the prime numbers are listed in increasing order (2, 3, 5, 7, 11, 13, 17, . .), then the prime-index primes are those which occur in a prime-numbered position in the list (3, 5, 11, 17, .
    [Show full text]
  • An Introduction to Modern Cryptology Within an Algebraic Framework John Szwast Eastern Washington University
    Eastern Washington University EWU Digital Commons EWU Masters Thesis Collection Student Research and Creative Works 2012 An introduction to modern cryptology within an algebraic framework John Szwast Eastern Washington University Follow this and additional works at: http://dc.ewu.edu/theses Part of the Physical Sciences and Mathematics Commons Recommended Citation Szwast, John, "An introduction to modern cryptology within an algebraic framework" (2012). EWU Masters Thesis Collection. 13. http://dc.ewu.edu/theses/13 This Thesis is brought to you for free and open access by the Student Research and Creative Works at EWU Digital Commons. It has been accepted for inclusion in EWU Masters Thesis Collection by an authorized administrator of EWU Digital Commons. For more information, please contact [email protected]. AN INTRODUCTION TO MODERN CRYPTOLOGY WITHIN AN ALGEBRAIC FRAMEWORK A Thesis Presented To Eastern Washington University Cheney, Washington In Partial Fulfillment of the Requirements for the Degree Master of Science By John Szwast Fall 2012 THESIS OF JOHN SZWAST APPROVED BY DATE: DR. RON GENTLE, GRADUATE STUDY COMMITTEE DATE: DR. DALE GARRAWAY, GRADUATE STUDY COMMITTEE DATE: DR. PAUL SCHIMPF, GRADUATE STUDY COMMITTEE Contents List of Figures vii List of Tables viii 1 Introduction 1 1.1 Scope . .1 1.2 Background . .2 1.3 Conventions and Notations . .2 1.4 Overview . .3 1.5 General Definitions . .4 1.6 Bit Operations and Big-O Notation . .5 1.6.1 Overview . .5 1.6.2 Time Estimates for Integer Arithmetic . .8 1.6.3 Time estimates for modular arithmetic . 12 1.7 Probability . 15 iii CONTENTS CONTENTS 1.7.1 Discrete distributions .
    [Show full text]
  • List of Numbers
    List of numbers This is a list of articles aboutnumbers (not about numerals). Contents Rational numbers Natural numbers Powers of ten (scientific notation) Integers Notable integers Named numbers Prime numbers Highly composite numbers Perfect numbers Cardinal numbers Small numbers English names for powers of 10 SI prefixes for powers of 10 Fractional numbers Irrational and suspected irrational numbers Algebraic numbers Transcendental numbers Suspected transcendentals Numbers not known with high precision Hypercomplex numbers Algebraic complex numbers Other hypercomplex numbers Transfinite numbers Numbers representing measured quantities Numbers representing physical quantities Numbers without specific values See also Notes Further reading External links Rational numbers A rational number is any number that can be expressed as the quotient or fraction p/q of two integers, a numerator p and a non-zero denominator q.[1] Since q may be equal to 1, every integer is a rational number. The set of all rational numbers, often referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by a boldface Q (or blackboard bold , Unicode ℚ);[2] it was thus denoted in 1895 byGiuseppe Peano after quoziente, Italian for "quotient". Natural numbers Natural numbers are those used for counting (as in "there are six (6) coins on the table") and ordering (as in "this is the third (3rd) largest city in the country"). In common language, words used for counting are "cardinal numbers" and words used for ordering are
    [Show full text]
  • Proof of the Twin Prime Conjecture
    Proof of the Twin Prime Conjecture Dieter Sengschmitt [email protected] -------- Abstract. I can proof that there are infinitely many twin primes. The twin prime counting function π2(n), which gives the number of twin primes less than or equal to n for any natural number n, is for lim n → ∞ [π(n)]2 lim n → ∞ π (n) = 2 C 2 2 n where π(n) is the prime counting function and C2 is the so-called twin prime constant with C2 = 0,6601618 … The prime numbers are equally distributed in the two progressions (6 i − 1) and (6 i + 1) as n → ∞, respectively. Thus the prime counting function π−(n), which gives the number of primes less than or equal to n of the form (6 i − 1), and the prime counting function π+(n), which gives the number of primes less than or equal to n of the form (6 i + 1), are for lim n → ∞ both equal and one half of the prime counting function π(n). To achieve both results I introduce a modified sieving method, based on the historical Eratosthenes 1 sieve. This sieving method uses a shortened number line which is of the natural number line ℕ, where every 6 integer i represents a possible twin prime of the form (6 i − 1, 6 i + 1) and where every prime p ≥ 5 generates p±1 p±1 two distinct infinite series c + p i with i = 1 to ∞ and with c = and c = p − , respectively, and 1,2 1 6 2 6 thus two “starting values” c1,2 within the interval [1, p].
    [Show full text]
  • Combinatorial Models of the Distribution of Prime Numbers
    mathematics Article Combinatorial Models of the Distribution of Prime Numbers Vito Barbarani European Physical Society, via Cancherini 85, 51039 Quarrata, Italy; [email protected] Abstract: This work is divided into two parts. In the first one, the combinatorics of a new class of randomly generated objects, exhibiting the same properties as the distribution of prime numbers, is solved and the probability distribution of the combinatorial counterpart of the n-th prime number is derived together with an estimate of the prime-counting function p(x). A proposition equivalent to the Prime Number Theorem (PNT) is proved to hold, while the equivalent of the Riemann Hypothesis (RH) is proved to be false with probability 1 (w.p. 1) for this model. Many identities involving Stirling numbers of the second kind and harmonic numbers are found, some of which appear to be new. The second part is dedicated to generalizing the model to investigate the conditions enabling both PNT and RH. A model representing a general class of random integer sequences is found, for which RH holds w.p. 1. The prediction of the number of consecutive prime pairs as a function of the gap d, is derived from this class of models and the results are in agreement with empirical data for large gaps. A heuristic version of the model, directly related to the sequence of primes, is discussed, and new integral lower and upper bounds of p(x) are found. Keywords: set partitions; stirling numbers of the second kind; harmonic numbers; prime number distribution; Riemann Hypothesis; Gumbel distribution 1.
    [Show full text]
  • UNSOLVED PROBLEMS in NUMBER THEORY Myung-Hwan Kim
    UNSOLVED PROBLEMS IN NUMBER THEORY Myung-Hwan Kim Department of Mathematics Seoul National University, Seoul 151-742, Korea Two Main Themes in Number Theory : 1. Study on Prime Numbers 2. Study on Diophantine Equations (A Diophantine equation is an equation with integer coefficients involving arbitrary number of variables such that its integral solutions are sought.) Almost all branches of modern number theory stem from these two themes. 1. Prime Numbers It is well known that every positive integer can be uniquely factored into a product of primes. So the prime numbers are the smallest units generating positive integers. 1-1. How many primes are there? Theorem. There are infinitely many primes. • (Euclid’s proof) Suppose there are only finitely many primes, say p ; p ; ; p , then 1 2 ··· n one can deduce an easy contradiction from the number p p p + 1. 1 2 ··· n 1 (Euler’s Proof) = . p:prime p 1 P Primes in Arithmetic Progression (Dirichlet, 1837) Let a; d be relatively prime • positive integers. Then there are infinitely many primes in the arithmetic progression : a; a + d; a + 2d; a + 3d; : ··· 1 Roughly of primes are in the a.p. φ(d) Typeset by -TEX AMS 1 For d 2, let p(a; d) be the smallest prime in the a.p. above and define p(d) = ≥ max p(a; d) 1 a d; gcd(a; d) = 1 . Linnik (1944) proved that p(d) < dL for f j ≤ ≤ g some constant L, called Linnik’s constant, independent of d. Kanold (1963) conjectured L = 2. Chen (1979) proved L 17, which is the best result so far.
    [Show full text]
  • Solved and Unsolved Problems in Number Theory
    CONTENTS PAGE PREFACE....................................... Chapter I FROM PERFECT KGXIBERS TO THE QUADRATIC RECIPROCITY LAW SECTION 1. Perfect Xumbcrs .......................................... 1 2 . Euclid ............ ............................. 4 3. Euler’s Converse Pr ................ ............... 8 SECOND EDITION 4 . Euclid’s Algorithm ....... ............................... 8 5. Cataldi and Others...... ............................... 12 6 . The Prime Kumber Theorem .............................. 15 Copyright 0.1962. by Daniel Shanks 7 . Two Useful Theorems ...................................... 17 Copyright 0. 1978. by Daniel Shanks 8. Fermat. and 0t.hcrs........................................ 19 9 . Euler’s Generalization Promd ............................... 23 10. Perfect Kunibers, I1 ....................................... 25 11. Euler and dial.. ........................... ............. 25 Library of Congress Cataloging in Publication Data 12. Many Conjectures and their Interrelations.................... 29 Shanks. Daniel . 13. Splitting tshe Primes into Equinumerous Classes ............... 31 Solved and unsolved problems in number theory. 14. Euler’s Criterion Formulated ...... ....................... 33 15. Euler’s Criterion Proved .................................... 35 Bibliography: p. Includes index . 16. Wilson’s Theorem ......................................... 37 1. Numbers. Theory of . I . Title. 17. Gauss’s Criterion ................................... 38 [QA241.S44 19781 5E.7 77-13010 18. The Original Lcgendre
    [Show full text]
  • An Introduction to the Twin Prime Conjecture
    An Introduction to The Twin Prime Conjecture Allison Berke December 12, 2006 Abstract Twin primes are primes of the form (p, p + 2). There are many proofs for the infinitude of prime numbers, but it is very difficult to prove whether there are an infinite number of pairs of twin primes. Most mathemati­ cians agree that the evidence points toward this conclusion, but numerous attempts at a proof have been falsified by subsequent review. The prob­ lem itself, one of the most famous open problems in mathematics, has yielded a number of related results, including Brun’s conjecture, Mertens’ theorems, and the Hardy-Littlewood Conjecture. Along with these con­ jectures, there are a number of results which are easier to arrive at, but nevertheless help mathematicians think about the infinitude of primes, and the special properties of twin primes. This paper will introduce the aforementioned conjectures associated with the twin prime conjecture, and work through some exercises that illuminate the difficulties and intricacies of the twin prime conjecture. 1 Introduction: The Original Conjecture and Failed Proofs The term twin prime was coined by Paul Stackel in the late nineteenth cen­ tury. Since that time, mathematicians have been interested in the properties of related primes, both in relation to number theory as a whole, and as specific, well-defined problems. One of the first results of looking at twin primes was the discovery that, aside from (3, 5), all twin primes are of the form 6n ± 1. This comes from noticing that any prime greater than 3 must be of the form 6n ± 1.
    [Show full text]