DOCSLIB.ORG

Wilson's Theorem Modulo P^ 2 Derived from Faulhaber Polynomials

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Wilson's Theorem Modulo P^ 2 Derived from Faulhaber Polynomials Wilson's theorem modulo p2 derived from Faulhaber polynomials Claire Levaillant December 17, 2019 Abstract. First, we present a new proof of Glaisher's formula dating from 1900 and concerning Wilson's theorem modulo p2. Our proof uses p-adic numbers and Faulhaber's formula for the sums of powers (17th century), as well as more recent results on Faulhaber's coefficients obtained by Gessel and Viennot. Second, by using our method, we find a simpler proof than Sun's proof regarding a formula for (p − 1)! modulo p3, and one that can be generalized to higher powers of p. Third, we can derive from our method a way to compute the Stirling numbers p modulo p3, thus improving Glaisher and Sun's own results from 120 s years ago and 20 years ago respectively. Last, our method allows to find new congruences on convolutions of divided Bernoulli numbers and convolutions of divided Bernoulli numbers with Bernoulli numbers. 1 Introduction The paper arose from an analogy between two polynomials, namely p−1 p−1 f(X) = X − 1 2 Z=p Z[X] and g(X) = X + (p − 1)! 2 Zp[X]; where p is a prime number, Z=p Z denotes the field with p elements and Zp denotes the ring of p-adic integers, see [23]. The analogy is concerned with the way each polynomial factors and with the congruences properties that can be derived in each case from the relations be- arXiv:1912.06652v1 [math.CO] 13 Dec 2019 tween the coefficients and the roots. Below, we describe the analogy in details. • First we look at the factorization of f(X) and the properties modulo p that can be derived from it. By Fermat's little theorem we have, p−1 k = 1 in Z=p Z 1 for all integers k with 1 ≤ k ≤ p − 1. It provides the p − 1 roots of f, and so f factors in Z=p Z[X] as f(X) = (X − 1)(X − 2) ::: (X − (p − 1)) Let us introduce some notations concerning the divided factorial which shall be useful throughout the paper. Notation 1. Let r be an integer with 1 ≤ r ≤ p − 2 and let i1; i2; : : : ; ir be r integers with 1 ≤ ik ≤ p − 1 for all k with 1 ≤ k ≤ r. We define the divided factorial (p − 1)!i1;:::; ir as (p − 1)! i1;:::; ir (p − 1)! := Qr k=1 ik From looking at the constant coefficient of f in both factored and expanded forms, we retrieve Wilson's theorem which reads (p − 1)! = −1 mod p This constitutes one of many proofs for Wilson's theorem. By looking at the other coefficients in both factored and expanded forms, we derive more relations, namely, p−1 X (p − 1)!k = 0 mod p (Coefficient in X) k=1 X (p − 1)!i;j = 0 mod p (Coefficient in X2) 1≤i<j≤p−1 . X (p − 1)!i1;:::; ir = 0 mod p (Coefficient in Xr) 1≤i1<i2<···<ir ≤p−1 . X (p − 1)!i1;:::; ip−2 = 0 mod p (Coefficient in Xp−2) 1≤i1<i2<···<ip−2≤p−1 The numbers to the left hand side are also the respective unsigned coeffi- cients of x2; x3; : : : ; xr+1; : : : ; xp−1 in the falling factorial x(x − 1)(x − 2) ::: (x − (p − 1)); that is the unsigned Stirling numbers of the first kind. p p p p ; ;:::; ;:::; 2 3 r + 1 p − 1 2 We summarize the preceding equalities by p 82 ≤ k ≤ p − 1; p j k These numbers were introduced by James Stirling in the 18th century. The bracket notation gets promoted by Donald Knuth by analogy with binomial coefficients. Namely, we have the well-known divisibility relations p 81 ≤ k ≤ p − 1; p j ; k a straightforward consequence of the definition of the binomial coefficients and of the Gauss lemma. Note that another equivalent definition for the unsigned Stirling numbers n of the first kind is the following: counts the number of permutations s of n elements that decompose into a product of s disjoint cycles, see [37] for a quantum combinatorial proof. While there exist lots of proofs for Wilson's theorem, little is advertised about Wilson's theorem modulo p2 or higher powers. It is even said at the end of 2 [25]: "There is no explicit formula for (p − 1)! mod p , ie the integer n1 in 2 (p − 1)! ≡ −1 + n1p mod p is no evident function of p". In [26], Wilson's theorem modulo p2 is only stated as 2 p−1 2p−2 p − 1 2 (p − 1)! ≡ (−1) 2 2 ! (mod p ) 2 However, British mathematician J.W.L. Glaisher, son of meteorologist and pi- oneer both of weather forecasting and of photography James Glaisher who in particular held the world record for the highest altitude reached in a balloon, found a formula for (p − 1)! mod p2 in 1900 [22] that uses Bernoulli numbers. His method is elegant, smart and straightforward, but does not generalize to higher powers of p. A hundred years later, in 2000, Z-H Sun provides a different perspective, see [49]. His method even allows him to compute (p − 1)! mod p3, thus generalizing Glaisher's result whose work had only led to a formula for (p−1)! mod p2. Sun's result modulo p3 is expressed in terms of divided Bernoulli numbers. Sun's ma- chinery is heavy but really beautiful and well exposed. First, he determines the 3 generalized harmonic numbers Hp−1;k modulo p . For that, he uses a battery of tools, namely: Euler's theorem ; Bernoulli's formula for the sums of powers modulo p3 together with von Staudt{Clausen theorem [53][13] that determines the fractional part of Bernoulli numbers ; K¨ummer'scongruences from 1851 involving Bernoulli numbers [36] and their generalizations modulo p2 by Sun himself [49] in the case when k ≤ p − 3, and an unpublished result of [50] giving 2 3 formulas for p Bk(p−1) modulo p and p respectively for dealing with k = p − 2 and k = p − 1 respectively. Second, he uses Newton's formulas together with 3 Bernoulli's formula modulo p2 in order to derive the Stirling numbers modulo p2. From there he obtains in particular a congruence for (p−1)! mod p3 that was first proven by Carlitz [9]. Likewise, by using Newton's formulas with general- ized harmonic numbers and what Sun denotes as the conjugates of the Stirling numbers, he finds a formula for the conjugate Stirling numbers modulo p2 fol- lowed by a "conjugate Carlitz congruence". By combining the various identities, he then derives a pioneering formula for (p − 1)! mod p3 that is expressed only in terms of Bernoulli numbers. Yet another twenty years later, we offer a third perspective which does not make any use of the Newton formulas. The polynomial g with p-adic integer coeffi- cients introduced earlier happens to be an even more powerful tool than the polynomial f for better prime precision. It highlights once again the beauty and efficiency of p-adic numbers when investigating local properties at powers of primes. Explicitly: • We now investigate the factorization of g(X). Let k be an integer with 1 ≤ k ≤ p − 1. First and foremost, we have p−1 g(k) = k + (p − 1)! 2 p Zp (1) by definition of g and by using Wilson's theorem modulo p. Moreover, we have 0 p−2 g (k) = (p − 1) k 62 p Zp (2) as kp−2 = k−1 6= 0 in Z=p Z. By Hensel's lemma [23], each nonzero k of Z=p Z lifts to a unique root xk of g such that k − xk 2 p Zp Write xk = k + p tk with tk 2 Zp Then g factors in Zp[X] as follows. g(X) = (X − 1 − p t1) ::: (X − (p − 1) − p tp−1) 2 We will see that by looking at the constant coefficient of g modulo p Zp, we obtain the next coefficient in the p-adic expansion of (p − 1)!, namely Theorem 1. p−1 X 2 (p − 1)! = −1 + p δ0(k) mod p ; k=1 with δ0(k) defined for each 1 ≤ k ≤ p − 1 by p−1 2 k = 1 + p δ0(k) mod p 4 Working out the sum of Theorem 1 modulo p2 by using the Faulhaber poly- nomials for the sums of powers and by using Faulhaber's neat statement on the relationship between the two trailing coefficients of the polynomial for odd powers (work done in the 17th century, [17]), we obtain Wilson's theorem one step further, namely modulo p2. p(p−1) Theorem 2. Let p be an odd prime number. Set p = 2l+1 and a = 2 . Let c1(l) be the trailing coefficient in the Faulhaber polynomial p−1 X p l+1 3 2 k = cl(l) a + ::: + c2(l) a + c1(l) a (3) k=1 We have, (i) 8 i 2 f 1; : : : ; lg; ci(l) 2 Zp 1 2 (ii)(p − 1)! = 2 c1(l) − p mod p Corollary 1. (Glaisher 1900 [22]) 2 (p − 1)! = p Bp−1 − p mod p Corollary 1 can be derived directly from Theorem 1 by using the Bernoulli formula for the sum of powers smartly modulo p2 (like Sun did in [49], see the proof of his congruence (5:1)) together with von Staudt{Clausen theorem. For future reference, Bernoulli's formula for the sums of powers reads: p m X 1 X m + 1 km = B pm+1−j; m + 1 j j k=1 j=0 where we wrote the formula using Bernoulli numbers of the second type, 1 1 that is B1 = 2 instead of B1 = − 2 .
Load more

Recommended publications
  • The Pseudoprimes to 25 • 109
    MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 151 JULY 1980, PAGES 1003-1026 The Pseudoprimes to 25 • 109 By Carl Pomerance, J. L. Selfridge and Samuel S. Wagstaff, Jr. Abstract. The odd composite n < 25 • 10 such that 2n_1 = 1 (mod n) have been determined and their distribution tabulated. We investigate the properties of three special types of pseudoprimes: Euler pseudoprimes, strong pseudoprimes, and Car- michael numbers. The theoretical upper bound and the heuristic lower bound due to Erdös for the counting function of the Carmichael numbers are both sharpened. Several new quick tests for primality are proposed, including some which combine pseudoprimes with Lucas sequences. 1. Introduction. According to Fermat's "Little Theorem", if p is prime and (a, p) = 1, then ap~1 = 1 (mod p). This theorem provides a "test" for primality which is very often correct: Given a large odd integer p, choose some a satisfying 1 <a <p - 1 and compute ap~1 (mod p). If ap~1 pi (mod p), then p is certainly composite. If ap~l = 1 (mod p), then p is probably prime. Odd composite numbers n for which (1) a"_1 = l (mod«) are called pseudoprimes to base a (psp(a)). (For simplicity, a can be any positive in- teger in this definition. We could let a be negative with little additional work. In the last 15 years, some authors have used pseudoprime (base a) to mean any number n > 1 satisfying (1), whether composite or prime.) It is well known that for each base a, there are infinitely many pseudoprimes to base a.
    [Show full text]
  • Composite Numbers That Give Valid RSA Key Pairs for Any Coprime P
    information Article Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p Barry Fagin ID Department of Computer Science, US Air Force Academy, Colorado Springs, CO 80840, USA; [email protected]; Tel.: +1-719-339-4514 Received: 13 August 2018; Accepted: 25 August 2018; Published: 28 August 2018 Abstract: RSA key pairs are normally generated from two large primes p and q. We consider what happens if they are generated from two integers s and r, where r is prime, but unbeknownst to the user, s is not. Under most circumstances, the correctness of encryption and decryption depends on the choice of the public and private exponents e and d. In some cases, specific (s, r) pairs can be found for which encryption and decryption will be correct for any (e, d) exponent pair. Certain s exist, however, for which encryption and decryption are correct for any odd prime r - s. We give necessary and sufficient conditions for s with this property. Keywords: cryptography; abstract algebra; RSA; computer science education; cryptography education MSC: [2010] 11Axx 11T71 1. Notation and Background Consider the RSA public-key cryptosystem and its operations of encryption and decryption [1]. Let (p, q) be primes, n = p ∗ q, f(n) = (p − 1)(q − 1) denote Euler’s totient function and (e, d) the ∗ Z encryption/decryption exponent pair chosen such that ed ≡ 1. Let n = Un be the group of units f(n) Z mod n, and let a 2 Un. Encryption and decryption operations are given by: (ae)d ≡ (aed) ≡ (a1) ≡ a mod n We consider the case of RSA encryption and decryption where at least one of (p, q) is a composite number s.
    [Show full text]
  • The Distribution of Pseudoprimes
    The Distribution of Pseudoprimes Matt Green September, 2002 The RSA crypto-system relies on the availability of very large prime num- bers. Tests for finding these large primes can be categorized as deterministic and probabilistic. Deterministic tests, such as the Sieve of Erastothenes, of- fer a 100 percent assurance that the number tested and passed as prime is actually prime. Despite their refusal to err, deterministic tests are generally not used to find large primes because they are very slow (with the exception of a recently discovered polynomial time algorithm). Probabilistic tests offer a much quicker way to find large primes with only a negligibal amount of error. I have studied a simple, and comparatively to other probabilistic tests, error prone test based on Fermat’s little theorem. Fermat’s little theorem states that if b is a natural number and n a prime then bn−1 ≡ 1 (mod n). To test a number n for primality we pick any natural number less than n and greater than 1 and first see if it is relatively prime to n. If it is, then we use this number as a base b and see if Fermat’s little theorem holds for n and b. If the theorem doesn’t hold, then we know that n is not prime. If the theorem does hold then we can accept n as prime right now, leaving a large chance that we have made an error, or we can test again with a different base. Chances improve that n is prime with every base that passes but for really big numbers it is cumbersome to test all possible bases.
    [Show full text]
  • Computations on Normal Families of Primes
    Computations on Normal Families of Primes bq' Erick Wong B-Sc., Simon Fraser University, 1994 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTEROF SCIENCE in the Department of k1athematic.s gd Statistics @ Erick Wong 1997 SIMON FRASER UNIVERSITY August 1997 iW rights reserved. This work may not be reproduced in whole or in part, by photocopy or other means, without the permission of the author. Acquisitions and Acquisitions et Bibliographic Se~*ces services bibliographiques 395 Wellington Street 395, rue Wellington ûttawa ON K1A ON4 ûttawa ON K1A ON4 Canada Canada The author has granted a non- L'auteur a accordé une licence non exclusive licence allowing the exclusive permettant à la National Library of Canada to Bibliothèque nationale du Canada de reproduce, ioan, disbiiute or sell reproduire, prêter, distribuer ou copies of this thesis in microfom, vendre des copies de cette thèse sous paper or elecbonic formats. la fonne de rnicrofiche/~de reproducticn sur papier ou sur format électronique. The author retains ownership of the L'auteur conseme la propriété du copyright in this thesis. Neither the droit d'auteur qui protège cette thèse. thesis nor substantial extracts fiom it Ni la thèse ni des extraits substantiels may be printed or otherwise de celle-ci ne doivent être imprimés reproduced without the author's ou autrement reproduits sans son permission. autorisation. Abstract We cal1 a farnily of primes P no.mnal if it contains no two primes p, q such that p divides q - 1. In this thesis we study two conjectures and their related variants.
    [Show full text]
  • On Types of Elliptic Pseudoprimes
    journal of Groups, Complexity, Cryptology Volume 13, Issue 1, 2021, pp. 1:1–1:33 Submitted Jan. 07, 2019 https://gcc.episciences.org/ Published Feb. 09, 2021 ON TYPES OF ELLIPTIC PSEUDOPRIMES LILJANA BABINKOSTOVA, A. HERNANDEZ-ESPIET,´ AND H. Y. KIM Boise State University e-mail address: [email protected] Rutgers University e-mail address: [email protected] University of Wisconsin-Madison e-mail address: [email protected] Abstract. We generalize Silverman's [31] notions of elliptic pseudoprimes and elliptic Carmichael numbers to analogues of Euler-Jacobi and strong pseudoprimes. We inspect the relationships among Euler elliptic Carmichael numbers, strong elliptic Carmichael numbers, products of anomalous primes and elliptic Korselt numbers of Type I, the former two of which we introduce and the latter two of which were introduced by Mazur [21] and Silverman [31] respectively. In particular, we expand upon the work of Babinkostova et al. [3] on the density of certain elliptic Korselt numbers of Type I which are products of anomalous primes, proving a conjecture stated in [3]. 1. Introduction The problem of efficiently distinguishing the prime numbers from the composite numbers has been a fundamental problem for a long time. One of the first primality tests in modern number theory came from Fermat Little Theorem: if p is a prime number and a is an integer not divisible by p, then ap−1 ≡ 1 (mod p). The original notion of a pseudoprime (sometimes called a Fermat pseudoprime) involves counterexamples to the converse of this theorem. A pseudoprime to the base a is a composite number N such aN−1 ≡ 1 mod N.
    [Show full text]
  • Note to Users
    NOTE TO USERS This reproduction is the best copy available. UMI A SURVEY OF RESULTS ON GIUGA'S CONJECTURE AND RELATED CONJECTURES by Joseph R. Hobart BSc., University of Northern British Columbia, 2004 THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE in MATHEMATICAL, COMPUTER AND PHYSICAL SCIENCES (MATHEMATICS) THE UNIVERSITY OF NORTHERN BRITISH COLUMBIA July 2005 © Joseph R. Hobart, 2005 Library and Bibliothèque et 1 ^ 1 Archives Canada Archives Canada Published Heritage Direction du Branch Patrimoine de l'édition 395 Wellington Street 395, rue Wellington Ottawa ON K1A0N4 Ottawa ON K1A0N4 Canada Canada Your file Votre référence ISBN: 978-0-494-28392-9 Our file Notre référence ISBN: 978-0-494-28392-9 NOTICE: AVIS: The author has granted a non­ L'auteur a accordé une licence non exclusive exclusive license allowing Library permettant à la Bibliothèque et Archives and Archives Canada to reproduce,Canada de reproduire, publier, archiver, publish, archive, preserve, conserve,sauvegarder, conserver, transmettre au public communicate to the public by par télécommunication ou par l'Internet, prêter, telecommunication or on the Internet,distribuer et vendre des thèses partout dans loan, distribute and sell theses le monde, à des fins commerciales ou autres, worldwide, for commercial or non­ sur support microforme, papier, électronique commercial purposes, in microform,et/ou autres formats. paper, electronic and/or any other formats. The author retains copyright L'auteur conserve la propriété du droit d'auteur ownership and moral rights in et des droits moraux qui protège cette thèse. this thesis. Neither the thesis Ni la thèse ni des extraits substantiels de nor substantial extracts from it celle-ci ne doivent être imprimés ou autrement may be printed or otherwise reproduits sans son autorisation.
    [Show full text]
  • Independence of the Miller-Rabin and Lucas Probable Prime Tests
    Independence of the Miller-Rabin and Lucas Probable Prime Tests Alec Leng Mentor: David Corwin March 30, 2017 1 Abstract In the modern age, public-key cryptography has become a vital component for se- cure online communication. To implement these cryptosystems, rapid primality test- ing is necessary in order to generate keys. In particular, probabilistic tests are used for their speed, despite the potential for pseudoprimes. So, we examine the commonly used Miller-Rabin and Lucas tests, showing that numbers with many nonwitnesses are usually Carmichael or Lucas-Carmichael numbers in a specific form. We then use these categorizations, through a generalization of Korselt’s criterion, to prove that there are no numbers with many nonwitnesses for both tests, affirming the two tests’ relative independence. As Carmichael and Lucas-Carmichael numbers are in general more difficult for the two tests to deal with, we next search for numbers which are both Carmichael and Lucas-Carmichael numbers, experimentally finding none less than 1016. We thus conjecture that there are no such composites and, using multi- variate calculus with symmetric polynomials, begin developing techniques to prove this. 2 1 Introduction In the current information age, cryptographic systems to protect data have become a funda- mental necessity. With the quantity of data distributed over the internet, the importance of encryption for protecting individual privacy has greatly risen. Indeed, according to [EMC16], cryptography is allows for authentication and protection in online commerce, even when working with vital financial information (e.g. in online banking and shopping). Now that more and more transactions are done through the internet, rather than in person, the importance of secure encryption schemes is only growing.
    [Show full text]
  • Idempotent Integers: the Complete Class of Numbers N = ¯P¯Q That Work
    Idempotent Integers: The complete class of numbers n =p ¯q¯ that work correctly in RSA A Mathematical Curiosity Barry Fagin Senior Associate Dean of the Faculty Professor of Computer Science United States Air Force Academy 2021 Conference on Geometry, Algebraic Number Theory and Applications Barry Fagin (A Mathematical Curiosity) Take two positive numbers p¯; q¯. Compute n =p ¯q¯. Pick e; d such that ed ≡ 1. (¯p−1)(¯q−1) What are the conditions on p¯; q¯ such that s.t. 1 ed ? 8a 2 Zn; 8e; d ed ≡ ; a ≡ a (¯p−1)(¯q−1) n In other words, what are the conditions on p¯; q¯ such that RSA works correctly? Note: not asking about security. Barry Fagin (A Mathematical Curiosity) 70's: p¯; q¯ prime meets the conditions. If suciently large, system is believed to be secure due to computational intractability of factoring. 90's: Some Carmichael numbers C also can be factored into p¯; q¯ that meet the required conditions. This work (since 2018) gives necessary and sucient conditions, shows examples. Barry Fagin (A Mathematical Curiosity) Cut to the chase Answer is: p¯; q¯ square free, gcd(p¯; q¯) = 1 such that (¯p − 1)(¯q − 1) ≡ 0 λ(n) where λ denotes the Carmichael lambda function. Barry Fagin (A Mathematical Curiosity) From n's point of view Equivalently, a square-free n can be factored into n =p ¯q¯ such that (¯p − 1)(¯q − 1) ≡ 0 λ(n) In that case, we say that n has an idempotent factorization, and that n is an idempotent integer. Barry Fagin (A Mathematical Curiosity) The rst 8 square-free n with m ≥ 3 factors that admit idempotent factorizations are shown below: n p or p¯ q¯ 30 5 6 42 7 6 66 11 6 78 13 6 102 17 6 105 7 15 114 19 6 130 13 10 Table: Values of n that admit idempotent factorizations Barry Fagin (A Mathematical Curiosity) Idempotent factorizations where one of p¯; q¯ is prime and one is composite are semi-composite.
    [Show full text]
  • Integer Sequences
    UHX6PF65ITVK Book > Integer sequences Integer sequences Filesize: 5.04 MB Reviews A very wonderful book with lucid and perfect answers. It is probably the most incredible book i have study. Its been designed in an exceptionally simple way and is particularly just after i finished reading through this publication by which in fact transformed me, alter the way in my opinion. (Macey Schneider) DISCLAIMER | DMCA 4VUBA9SJ1UP6 PDF > Integer sequences INTEGER SEQUENCES Reference Series Books LLC Dez 2011, 2011. Taschenbuch. Book Condition: Neu. 247x192x7 mm. This item is printed on demand - Print on Demand Neuware - Source: Wikipedia. Pages: 141. Chapters: Prime number, Factorial, Binomial coeicient, Perfect number, Carmichael number, Integer sequence, Mersenne prime, Bernoulli number, Euler numbers, Fermat number, Square-free integer, Amicable number, Stirling number, Partition, Lah number, Super-Poulet number, Arithmetic progression, Derangement, Composite number, On-Line Encyclopedia of Integer Sequences, Catalan number, Pell number, Power of two, Sylvester's sequence, Regular number, Polite number, Ménage problem, Greedy algorithm for Egyptian fractions, Practical number, Bell number, Dedekind number, Hofstadter sequence, Beatty sequence, Hyperperfect number, Elliptic divisibility sequence, Powerful number, Znám's problem, Eulerian number, Singly and doubly even, Highly composite number, Strict weak ordering, Calkin Wilf tree, Lucas sequence, Padovan sequence, Triangular number, Squared triangular number, Figurate number, Cube, Square triangular
    [Show full text]
  • Fermat Pseudoprimes
    1 TWO HUNDRED CONJECTURES AND ONE HUNDRED AND FIFTY OPEN PROBLEMS ON FERMAT PSEUDOPRIMES (COLLECTED PAPERS) Education Publishing 2013 Copyright 2013 by Marius Coman Education Publishing 1313 Chesapeake Avenue Columbus, Ohio 43212 USA Tel. (614) 485-0721 Peer-Reviewers: Dr. A. A. Salama, Faculty of Science, Port Said University, Egypt. Said Broumi, Univ. of Hassan II Mohammedia, Casablanca, Morocco. Pabitra Kumar Maji, Math Department, K. N. University, WB, India. S. A. Albolwi, King Abdulaziz Univ., Jeddah, Saudi Arabia. Mohamed Eisa, Dept. of Computer Science, Port Said Univ., Egypt. EAN: 9781599732572 ISBN: 978-1-59973-257-2 1 INTRODUCTION Prime numbers have always fascinated mankind. For mathematicians, they are a kind of “black sheep” of the family of integers by their constant refusal to let themselves to be disciplined, ordered and understood. However, we have at hand a powerful tool, insufficiently investigated yet, which can help us in understanding them: Fermat pseudoprimes. It was a night of Easter, many years ago, when I rediscovered Fermat’s "little" theorem. Excited, I found the first few Fermat absolute pseudoprimes (561, 1105, 1729, 2465, 2821, 6601, 8911…) before I found out that these numbers are already known. Since then, the passion for study these numbers constantly accompanied me. Exceptions to the above mentioned theorem, Fermat pseudoprimes seem to be more malleable than prime numbers, more willing to let themselves to be ordered than them, and their depth study will shed light on many properties of the primes, because it seems natural to look for the rule studying it’s exceptions, as a virologist search for a cure for a virus studying the organisms that have immunity to the virus.
    [Show full text]
  • Giuga Numbers and the Arithmetic Derivative
    1 2 Journal of Integer Sequences, Vol. 15 (2012), 3 Article 12.4.1 47 6 23 11 Giuga Numbers and the Arithmetic Derivative Jos´eMar´ıa Grau Departamento de Matematicas Universidad de Oviedo Avda. Calvo Sotelo, s/n 33007 Oviedo Spain [email protected] Antonio M. Oller-Marc´en Centro Universitario de la Defensa Ctra. de Huesca, s/n 50090 Zaragoza Spain [email protected] Abstract We characterize Giuga numbers as solutions to the equation n′ = an + 1, with a ∈ N and n′ being the arithmetic derivative. Although this fact does not refute Lava’s conjecture, it does suggest doubts about its veracity. 1 Introduction 1.1 The Arithmetic Derivative The arithmetic derivative was introduced by Barbeau [3] (see A003415 in Sloane’s On-Line Encyclopedia of Integer Sequences). The derivative of an integer is defined to be the unique map sending every prime to 1 and satisfying the Leibnitz rule, i.e., p′ = 1, for any prime p, and (nm)′ = nm′ + mn′ for any n, m ∈ N. This map makes sense and is well-defined [7]. 1 Proposition 1. n k pri n If = Qi=1 i is the factorization of in prime powers, then the only way to define n′ satisfying the desired properties is k ′ ri n = n X . pi i=1 1.2 Giuga numbers In [4], Giuga numbers were introduced in the following way motivated by previous work by Giuga [6]. n Definition 2. A Giuga number is a composite number n such that p divides p − 1 for every prime divisor p of n.
    [Show full text]
  • Improving the Speed and Accuracy of the Miller-Rabin Primality Test
    Improving the Speed and Accuracy of the Miller-Rabin Primality Test Shyam Narayanan Mentor: David Corwin MIT PRIMES-USA Abstract Currently, even the fastest deterministic primality tests run slowly, with the Agrawal- Kayal-Saxena (AKS) Primality Test runtime O~(log6(n)), and probabilistic primality tests such as the Fermat and Miller-Rabin Primality Tests are still prone to false re- sults. In this paper, we discuss the accuracy of the Miller-Rabin Primality Test and the number of nonwitnesses for a composite odd integer n. We also extend the Miller- '(n) Rabin Theorem by determining when the number of nonwitnesses N(n) equals 4 5 and by proving that for all n, if N(n) > · '(n) then n must be of one of these 3 32 forms: n = (2x + 1)(4x + 1), where x is an integer, n = (2x + 1)(6x + 1), where x is an integer, n is a Carmichael number of the form pqr, where p, q, r are distinct primes congruent to 3 (mod 4). We then find witnesses to certain forms of composite numbers with high rates of nonwitnesses and find that Jacobi nonresidues and 2 are both valuable bases for the Miller-Rabin test. Finally, we investigate the frequency of strong pseudoprimes further and analyze common patterns using MATLAB. This work is expected to result in a faster and better primality test for large integers. 1 1 Introduction Data is growing at an astoundingly rapid rate, and better information security is re- quired to protect increasing quantities of data. Improved data protection requires more sophisticated cryptographic methods.
    [Show full text]