Advertisement

Resonance

, Volume 24, Issue 3, pp 339–357 | Cite as

Investigating the Primes

  • Kaneenika SinhaEmail author
General Article
  • 11 Downloads

Abstract

The aim of this expository article is to introduce the reader to some of the fundamental milestones in the study of prime numbers across several centuries. Among the important developments in the study of prime numbers, we review the history of the prime number theorem, the Riemann zeta function (in relation to prime number theory), and some recent investigations into spacings between consecutive primes. We also present an important application of prime numbers in safe data transmission, namely the ‘RSA public key cryptosystem’.

Keywords

Prime numbers sieve methods Riemann zeta function cryptography 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Suggested Reading

  1. [1]
    M H Weissman, Why Prime Numbers Still Fascinate Mathematicians, 2,300 Years Later, The Conversation, April 2, 2018. https://doi.org/theconversation.com/why-prime-numbers-still-fascinate-mathematicians-2-300-years-later-92484.Google Scholar
  2. [2]
    B Riemann, Ueber die Anzahl der Primzahlen unter einer gegebenen Grösse, Bernard Riemann’s Gesammelte Mathematische Werke Und Wissenschaftliche Nachlass, Zweite Auflage, pp.145–155, Teubner, Leipzig, 1892; reprinted, Dover, New York, 1953.Google Scholar
  3. [3]
    A Granville, What is the Best Approach to Counting Primes? A century of Advancing Mathematics, Math. Assoc. America, pp.83–116,, Washington, DC, 2015.Google Scholar
  4. [4]
    H M Edwards, Riemann’s Zeta Function, Reprint of the 1974 original [Academic Press, New York], Dover Publications, Inc., Mineola, NY, 2001.Google Scholar
  5. [5]
    K Soundararajan, Small Gaps Between Prime Numbers: The Work of Goldston-Pintz-Yildirim, Bulletin of the American Mathematical Society (N. S.), Vol.44, No.1, pp.1–18, 2007.CrossRefGoogle Scholar
  6. [6]
    M R Murty, New Developments on the Twin Prime Problem and Generalizations, Hardy-Ramanujan Journal, Vol.37, pp.13–19, 2014.Google Scholar
  7. [7]
    R L Rivest, A Shamir and L Adleman, A Method for Obtaining Digital Signatures and Public-key Cryptosystems, Communications of the Association for Computing Machinery, Vol.21, No.2, pp.120–126, 1978.CrossRefGoogle Scholar

Copyright information

© Indian Academy of Sciences 2019

Authors and Affiliations

  1. 1.IISER PunePashan, PuneIndia

Personalised recommendations