The Prime Unsolved Problem in Mathematics

Size: px
Start display at page:

Download "The Prime Unsolved Problem in Mathematics"

Transcription

1 The Prime Unsolved Problem in Mathematics March, 0 Augustana Math Club

2 859: Bernard Riemann proposes the Riemann Hypothesis.

3 859: Bernard Riemann proposes the Riemann Hypothesis. 866: Riemann dies at age 39, having published only 9 papers.

4 859: Bernard Riemann proposes the Riemann Hypothesis. 866: Riemann dies at age 39, having published only 9 papers. 900: The RH makes Hilbert s list of 3 unsolved problems for the 0 th century (only 3 remain).

5 859: Bernard Riemann proposes the Riemann Hypothesis. 866: Riemann dies at age 39, having published only 9 papers. 900: The RH makes Hilbert s list of 3 unsolved problems for the 0 th century (only 3 remain). 000: The RH is chosen as one of 7 Millenium Problems and assigned a $,000,000 bounty.

6 OUTLINE

7 OUTLINE () Where are the PRIME NUMBERS?

8 OUTLINE () Where are the PRIME NUMBERS? () What is the ZETA FUNCTION?

9 OUTLINE () Where are the PRIME NUMBERS? () What is the ZETA FUNCTION? (3) Where are the ZETA ZEROS?

10 OUTLINE () Where are the PRIME NUMBERS? () What is the ZETA FUNCTION? (3) Where are the ZETA ZEROS? the RIEMANN HYPOTHESIS

11 OUTLINE () Where are the PRIME NUMBERS? () What is the ZETA FUNCTION? (3) Where are the ZETA ZEROS? the RIEMANN HYPOTHESIS (4) How does this CONNECT to other areas of math and physics?

12 PART Where are the PRIME NUMBERS?

13 The PRIME COUNTING FUNCTION π()

14 The PRIME COUNTING FUNCTION π()

15 The PRIME COUNTING FUNCTION π()

16 The PRIME COUNTING FUNCTION π()

17 What are the chances that a number of a certain size is prime?

18 What are the chances that a number of a certain size is prime? P( ) ~

19 What are the chances that a number of a certain size is prime? P ~ ) ( P ~ 5 3 ) (

20 What are the chances that a number of a certain size is prime? P ~ ) ( P ~ 5 3 ) ( P ~ 5 3 ) (

21 What are the chances that a number of a certain size is prime? P ~ ) ( P ~ 5 3 ) ( P ~ 5 3 ) ( 3 series: Geometric

22 3 3 ) ( P P ~ 5 3 ) (

23 3 3 ) ( P P 4 3 ~ ) ( P ~ 5 3 ) (

24 3 3 ) ( P P 4 3 ~ ) ( P ~ ln ) ( P ~ 5 3 ) (

25 3 3 ) ( P P 4 3 ~ ) ( P ~ ln ) ( P ln ~ ) ( P ~ 5 3 ) (

26 PRIME NUMBER THEOREM P( ) ~ ln ( ) ~ lnt dt ~ Li( ) ~ ln

27 Testing the Prime Number Theorem Li() π()

28 Testing the Prime Number Theorem Li() π()

29 Testing the Prime Number Theorem Li() π()

30 Testing the Prime Number Theorem Li() π()

31 PART What is the ZETA FUNCTION?

32 P ~ 5 3 ) ( P ~ ln 4 3 ~ ) ( Recall

33 P ~ 5 3 ) ( P ~ ln 4 3 ~ ) ( Recall n p n p numbers whole primes /

34 P ~ 5 3 ) ( P ~ ln 4 3 ~ ) ( Recall n p n p numbers whole primes / n s p s n p /

35 P ~ 5 3 ) ( P ~ ln 4 3 ~ ) ( Recall n p n p numbers whole primes / n s p s n p / (s) ZETA FUNCTION

36 THE ZETA FUNCTION ζ(s) () () 6.6

37 EXTENDING THE ZETA FUNCTION While ζ(s) only converges for s>, there are ways to rewrite it so that: () we still get the same behavior when s> () the function is defined for s< as well

38 EXTENDING THE ZETA FUNCTION While ζ(s) only converges for s>, there are ways to rewrite it so that: () we still get the same behavior when s> () the function is defined for s< as well ( s) n ( ) for s s s n n 0

39 EXTENDING THE ZETA FUNCTION Riemann found a formula for s<0 ( s) s s s sin ( s) ( s)

40 EXTENDING THE ZETA FUNCTION Riemann found a formula for s<0 ( s) s s s sin ( Then he allowed s to be a comple variable : s s) ( iy s)

41 EXTENDING THE ZETA FUNCTION Riemann found a formula for s<0 ( s) s s s sin ( Then he allowed s to be a comple variable : s s) ( iy s) We now call this etended function the RIEMANN ZETA FUNCTION

42 PART 3 Where are the ZETA ZEROS?

43 Graphing comple functions is tricky ( 4) 0

44 Trivial zeta zeros: ( n) 0

45 Cool things happening near the imaginary ais (y) lots of potential zeros =½ seems to be important

46 Nontrivial zeta zeros: ( it ) 0 n t t t t

47 ( s) s s s sin ( s) ( s) ZETA ZEROS

48 non-trivial zeros trivial zeros

49 RIEMANN HYPOTHESIS All nontrivial zeros of ζ(s) lie along the line s it.

50 So far: over 0 trillion nontrivial zeros found, all of which lie on the critical line. But all it takes is a single countereample

51 What did Riemann want with this?

52 What did Riemann want with this? ( ) ( ) Li( ) Prime Counting Function Logarithmic Integral

53 What did Riemann want with this? ( ) ( ) Li( ) Prime Counting Function Logarithmic Integral Prime Number Theorem: Δ() is small

54 What did Riemann want with this? ( ) ( ) Li( ) Prime Counting Function Logarithmic Integral Prime Number Theorem: Δ() is small Riemann constructed an eact formula for Δ() in terms of the zeta zeros!

55 Li() Δ() π()

56 PART 4 How does this CONNECT to other areas?

57 RSA PUBLIC-KEY CRYPTOGRAPHY

58 RSA PUBLIC-KEY CRYPTOGRAPHY () Locate large prime numbers p and q (say, 00 or so digits each).

59 RSA PUBLIC-KEY CRYPTOGRAPHY () Locate large prime numbers p and q (say, 00 or so digits each). () Compute n = p q and publish n as a public key for encrypting messages.

60 RSA PUBLIC-KEY CRYPTOGRAPHY () Locate large prime numbers p and q (say, 00 or so digits each). () Compute n = p q and publish n as a public key for encrypting messages. (3) Decryption requires p and q, a very time-consuming task if the RH is true.

61 QUANTUM MECHANICS

62 QUANTUM MECHANICS () Consider a giant atomic nucleus (say, with thousands of p and n)

63 QUANTUM MECHANICS () Consider a giant atomic nucleus (say, with thousands of p and n) () The interactions are complicated and unknown, but we have had success with random matri models

64 QUANTUM MECHANICS () Consider a giant atomic nucleus (say, with thousands of p and n) () The interactions are complicated and unknown, but we have had success with random matri models (3) The eigenvalues of these giant random matrices turn out to have the same statistical properties as the zeta zeros

65 QUANTUM MECHANICS (4)This suggests that there might be a physical system whose QM energy levels correspond eactly to the zeta zeros.

66 QUANTUM MECHANICS (4)This suggests that there might be a physical system whose QM energy levels correspond eactly to the zeta zeros. (5) If such a system can be constructed, the RH is then a direct consequence of the requirement that these energy levels are real eigenvalues.

67 CONNECTIONS IN MATH Mathematics is more than a collection of facts and calculational techniques. Mathematics, at its most beautiful, shows deep connections between objects, ideas, or systems that seem to be unrelated.

68 CONNECTIONS IN MATH The real reward for proving or disproving the RH is not the yes/no answer itself, but rather how the techniques used will influence many different areas of mathematics.

69

70

71

Riemann s Zeta Function and the Prime Number Theorem

Riemann s Zeta Function and the Prime Number Theorem Riemann s Zeta Function and the Prime Number Theorem Dan Nichols nichols@math.umass.edu University of Massachusetts Dec. 7, 2016 Let s begin with the Basel problem, first posed in 1644 by Mengoli. Find

More information

Math 495 Dr. Rick Kreminski Colorado State University Pueblo November 19, 2014 The Riemann Hypothesis: The #1 Problem in Mathematics

Math 495 Dr. Rick Kreminski Colorado State University Pueblo November 19, 2014 The Riemann Hypothesis: The #1 Problem in Mathematics Math 495 Dr. Rick Kreminski Colorado State University Pueblo November 19, 14 The Riemann Hypothesis: The #1 Problem in Mathematics Georg Friedrich Bernhard Riemann 1826-1866 One of 6 Million Dollar prize

More information

Cryptography: Joining the RSA Cryptosystem

Cryptography: Joining the RSA Cryptosystem Cryptography: Joining the RSA Cryptosystem Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin Joining the RSA Cryptosystem: Overview First,

More information

Riemann Conjecture Proof and Disproof

Riemann Conjecture Proof and Disproof From the SelectedWorks of James T Struck Winter March 2, 2018 Riemann Conjecture Proof and Disproof James T Struck Available at: https://works.bepress.com/james_struck/72/ Disproving and Proving the Riemann

More information

Random matrices and the Riemann zeros

Random matrices and the Riemann zeros Random matrices and the Riemann zeros Bruce Bartlett Talk given in Postgraduate Seminar on 5th March 2009 Abstract Random matrices and the Riemann zeta function came together during a chance meeting between

More information

The Riemann Hypothesis

The Riemann Hypothesis University of Hawai i at Mānoa January 26, 2016 The distribution of primes Euclid In ancient Greek times, Euclid s Elements already answered the question: Q: How many primes are there? Euclid In ancient

More information

Prime Numbers and Shizits

Prime Numbers and Shizits Prime Numbers and Shizits Nick Handrick, Chris Magyar University of Wisconsin Eau Claire March 7, 2017 Book IX: Proposition 20 Euclid, cerca 300 BCE Prime numbers are more than any assigned multitude of

More information

Needles and Numbers. The Buffon Needle Experiment

Needles and Numbers. The Buffon Needle Experiment eedles and umbers This excursion into analytic number theory is intended to complement the approach of our textbook, which emphasizes the algebraic theory of numbers. At some points, our presentation lacks

More information

Review Algebra and Functions & Equations (10 questions)

Review Algebra and Functions & Equations (10 questions) Paper 1 Review No calculator allowed [ worked solutions included ] 1. Find the set of values of for which e e 3 e.. Given that 3 k 1 is positive for all values of, find the range of possible values for

More information

Overview. Background / Context. CSC 580 Cryptography and Computer Security. March 21, 2017

Overview. Background / Context. CSC 580 Cryptography and Computer Security. March 21, 2017 CSC 580 Cryptography and Computer Security Math for Public Key Crypto, RSA, and Diffie-Hellman (Sections 2.4-2.6, 2.8, 9.2, 10.1-10.2) March 21, 2017 Overview Today: Math needed for basic public-key crypto

More information

PROOF OF RIEMANN S HYPOTHESIS. MSC 2010 : 11A41; 11M06; 11M26 Keywords: Euler; Riemann; Hilbert; Polya; conjecture

PROOF OF RIEMANN S HYPOTHESIS. MSC 2010 : 11A41; 11M06; 11M26 Keywords: Euler; Riemann; Hilbert; Polya; conjecture PROOF OF RIEMANN S HYPOTHESIS ROBERT DELOIN Abstract. Riemann s hypothesis (859) is the conjecture stating that: The real part of every non trivial zero of Riemann s zeta function is /. The main contribution

More information

A Proof of the Riemann Hypothesis and Determination of the Relationship Between Non- Trivial Zeros of Zeta Functions and Prime Numbers

A Proof of the Riemann Hypothesis and Determination of the Relationship Between Non- Trivial Zeros of Zeta Functions and Prime Numbers A Proof of the Riemann Hypothesis and Determination of the Relationship Between on- Trivial Zeros of Zeta Functions and Prime umbers ABSTRACT Murad Ahmed Abu Amr MSc Degree in Physics, Mutah University

More information

Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya

Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya BBM 205 Discrete Mathematics Hacettepe University http://web.cs.hacettepe.edu.tr/ bbm205 Lecture 5: Arithmetic Modulo m, Primes and Greatest Common Divisors Lecturer: Lale Özkahya Resources: Kenneth Rosen,

More information

Riemann Hypotheses. Alex J. Best 4/2/2014. WMS Talks

Riemann Hypotheses. Alex J. Best 4/2/2014. WMS Talks Riemann Hypotheses Alex J. Best WMS Talks 4/2/2014 In this talk: 1 Introduction 2 The original hypothesis 3 Zeta functions for graphs 4 More assorted zetas 5 Back to number theory 6 Conclusion The Riemann

More information

Prime Numbers. Prime Numbers. Ramesh Sreekantan ISI, Bangalore. December 1, 2014

Prime Numbers. Prime Numbers. Ramesh Sreekantan ISI, Bangalore. December 1, 2014 Prime Numbers Prime Numbers Ramesh Sreekantan ISI, Bangalore December 1, 2014 Introduction - Prime Numbers Prime numbers are the numbers 2,3,5,7... These are natural numbers which cannot be divided by

More information

Moments of the Riemann Zeta Function and Random Matrix Theory. Chris Hughes

Moments of the Riemann Zeta Function and Random Matrix Theory. Chris Hughes Moments of the Riemann Zeta Function and Random Matrix Theory Chris Hughes Overview We will use the characteristic polynomial of a random unitary matrix to model the Riemann zeta function. Using this,

More information

Properties of Linear Transformations from R n to R m

Properties of Linear Transformations from R n to R m Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation

More information

Mathematics of Public Key Cryptography

Mathematics of Public Key Cryptography Mathematics of Public Key Cryptography Eric Baxter April 12, 2014 Overview Brief review of public-key cryptography Mathematics behind public-key cryptography algorithms What is Public-Key Cryptography?

More information

The real primes and the Riemann hypothesis. Jamel Ghanouchi. Ecole Supérieure des Sciences et Techniques de Tunis.

The real primes and the Riemann hypothesis. Jamel Ghanouchi. Ecole Supérieure des Sciences et Techniques de Tunis. The real primes and the Riemann hypothesis Jamel Ghanouchi Ecole Supérieure des Sciences et Techniques de Tunis Jamel.ghanouchi@live.com bstract In this paper, we present the Riemann problem and define

More information

Riemann Zeta Function and Prime Number Distribution

Riemann Zeta Function and Prime Number Distribution Riemann Zeta Function and Prime Number Distribution Mingrui Xu June 2, 24 Contents Introduction 2 2 Definition of zeta function and Functional Equation 2 2. Definition and Euler Product....................

More information

Introduction to Elliptic Curve Cryptography. Anupam Datta

Introduction to Elliptic Curve Cryptography. Anupam Datta Introduction to Elliptic Curve Cryptography Anupam Datta 18-733 Elliptic Curve Cryptography Public Key Cryptosystem Duality between Elliptic Curve Cryptography and Discrete Log Based Cryptography Groups

More information

The Riemann Hypothesis

The Riemann Hypothesis The Riemann Hypothesis Matilde N. Laĺın GAME Seminar, Special Series, History of Mathematics University of Alberta mlalin@math.ualberta.ca http://www.math.ualberta.ca/~mlalin March 5, 2008 Matilde N. Laĺın

More information

Understanding the Prime Number Theorem

Understanding the Prime Number Theorem Understanding the Prime Number Theorem Misunderstood Monster or Beautiful Theorem? Liam Fowl September 5, 2014 Liam Fowl Understanding the Prime Number Theorem 1/20 Outline 1 Introduction 2 Complex Plane

More information

arxiv: v2 [math.nt] 28 Feb 2010

arxiv: v2 [math.nt] 28 Feb 2010 arxiv:002.47v2 [math.nt] 28 Feb 200 Two arguments that the nontrivial zeros of the Riemann zeta function are irrational Marek Wolf e-mail:mwolf@ift.uni.wroc.pl Abstract We have used the first 2600 nontrivial

More information

Week Quadratic forms. Principal axes theorem. Text reference: this material corresponds to parts of sections 5.5, 8.2,

Week Quadratic forms. Principal axes theorem. Text reference: this material corresponds to parts of sections 5.5, 8.2, Math 051 W008 Margo Kondratieva Week 10-11 Quadratic forms Principal axes theorem Text reference: this material corresponds to parts of sections 55, 8, 83 89 Section 41 Motivation and introduction Consider

More information

Today: Particle-in-a-Box wavefunctions

Today: Particle-in-a-Box wavefunctions Today: Particle-in-a-Bo wavefunctions 1.Potential wells.solving the S.E. 3.Understanding the results. HWK11 due Wed. 5PM. Reading for Fri.: TZ&D Chap. 7.1 PE for electrons with most PE. On top work function

More information

Limits and Future of Computing Where do we go from here?

Limits and Future of Computing Where do we go from here? Limits and Future of Computing Where do we go from here? Notes for CSC 100 - The Beauty and Joy of Computing The University of North Carolina at Greensboro Back to Algorithms... Recall that algorithms

More information

Logic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation

Logic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation Quantum logic gates Logic gates Classical NOT gate Quantum NOT gate (X gate) A NOT A α 0 + β 1 X α 1 + β 0 A N O T A 0 1 1 0 Matrix form representation 0 1 X = 1 0 The only non-trivial single bit gate

More information

C.T.Chong National University of Singapore

C.T.Chong National University of Singapore NUMBER THEORY AND THE DESIGN OF FAST COMPUTER ALGORITHMS C.T.Chong National University of Singapore The theory of numbers has long been considered to be among the purest of pure mathematics. Gauss ( 1777-1855)

More information

Logarithms Tutorial for Chemistry Students

Logarithms Tutorial for Chemistry Students 1 Logarithms 1.1 What is a logarithm? Logarithms Tutorial for Chemistry Students Logarithms are the mathematical function that is used to represent the number (y) to which a base integer (a) is raised

More information

The Prime Number Theorem

The Prime Number Theorem Chapter 3 The Prime Number Theorem This chapter gives without proof the two basic results of analytic number theory. 3.1 The Theorem Recall that if f(x), g(x) are two real-valued functions, we write to

More information

A Brief Proof of the Riemann Hypothesis, Giving Infinite Results. Item Total Pages

A Brief Proof of the Riemann Hypothesis, Giving Infinite Results. Item Total Pages A Brief Proof of the Riemann Hypothesis, Giving Infinite Results Item 42 We will also show a positive proof of Fermat s Last Theorem, also related to the construction of the universe. 9 Total Pages 1 A

More information

A Simple Counterexample to Havil s Reformulation of the Riemann Hypothesis

A Simple Counterexample to Havil s Reformulation of the Riemann Hypothesis A Simple Counterexample to Havil s Reformulation of the Riemann Hypothesis Jonathan Sondow 209 West 97th Street New York, NY 0025 jsondow@alumni.princeton.edu The Riemann Hypothesis (RH) is the greatest

More information

You separate binary numbers into columns in a similar fashion. 2 5 = 32

You separate binary numbers into columns in a similar fashion. 2 5 = 32 RSA Encryption 2 At the end of Part I of this article, we stated that RSA encryption works because it s impractical to factor n, which determines P 1 and P 2, which determines our private key, d, which

More information

Homework 1 Submission

Homework 1 Submission Homework Submission Sample Solution; Due Date: Thursday, May 4, :59 pm Directions: Your solutions should be typed and submitted as a single pdf on Gradescope by the due date. L A TEX is preferred but not

More information

Solutions to Problem Set 4 - Fall 2008 Due Tuesday, Oct. 7 at 1:00

Solutions to Problem Set 4 - Fall 2008 Due Tuesday, Oct. 7 at 1:00 Solutions to 8.78 Problem Set 4 - Fall 008 Due Tuesday, Oct. 7 at :00. (a Prove that for any arithmetic functions f, f(d = f ( n d. To show the relation, we only have to show this equality of sets: {d

More information

Exponential function-its Applications

Exponential function-its Applications International Journal of Materials Science ISSN 0973-4589 Volume 12, Number 2 (2017), pp. 379-383 Research India Publications http://www.ripublication.com Eponential function-its Applications Dr. G. Sreenivasulu

More information

Calculus II : Prime suspect

Calculus II : Prime suspect Calculus II : Prime suspect January 31, 2007 TEAM MEMBERS An integer p > 1 is prime if its only positive divisors are 1 and p. In his 300 BC masterpiece Elements Euclid proved that there are infinitely

More information

ECE 487 Lecture 5 : Foundations of Quantum Mechanics IV Class Outline:

ECE 487 Lecture 5 : Foundations of Quantum Mechanics IV Class Outline: ECE 487 Lecture 5 : Foundations of Quantum Mechanics IV Class Outline: Linearly Varying Potential Triangular Potential Well Time-Dependent Schrödinger Equation Things you should know when you leave Key

More information

Primes, queues and random matrices

Primes, queues and random matrices Primes, queues and random matrices Peter Forrester, M&S, University of Melbourne Outline Counting primes Counting Riemann zeros Random matrices and their predictive powers Queues 1 / 25 INI Programme RMA

More information

Advanced Higher Grade

Advanced Higher Grade Prelim Eamination / 5 (Assessing Units & ) MATHEMATICS Advanced Higher Grade Time allowed - hours Read Carefully. Full credit will be given only where the solution contains appropriate woring.. Calculators

More information

Eigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization

Eigenvalues for Triangular Matrices. ENGI 7825: Linear Algebra Review Finding Eigenvalues and Diagonalization Eigenvalues for Triangular Matrices ENGI 78: Linear Algebra Review Finding Eigenvalues and Diagonalization Adapted from Notes Developed by Martin Scharlemann June 7, 04 The eigenvalues for a triangular

More information

Example 2: Student work M ATHS COURSEWORK. Mathematics SL and HL teacher support material 1. Proving Euler s Totient Theorem

Example 2: Student work M ATHS COURSEWORK. Mathematics SL and HL teacher support material 1. Proving Euler s Totient Theorem M ATHS COURSEWORK Mathematics SL and HL teacher support material 1 TA B L E O F C O N T E N T S Maths Coursework 3 Introduction 3 The Theorem 3 Euler s Totient Function 3 Fermat s Little Theorem 4 Proving

More information

SOME FAMOUS UNSOLVED PROBLEMS. November 18, / 5

SOME FAMOUS UNSOLVED PROBLEMS. November 18, / 5 SOME FAMOUS UNSOLVED PROBLEMS November 18, 2014 1 / 5 SOME FAMOUS UNSOLVED PROBLEMS Goldbach conjecture: Every even number greater than four is the sum of two primes. November 18, 2014 1 / 5 SOME FAMOUS

More information

MATH 1242 FINAL EXAM Spring,

MATH 1242 FINAL EXAM Spring, MATH 242 FINAL EXAM Spring, 200 Part I (MULTIPLE CHOICE, NO CALCULATORS).. Find 2 4x3 dx. (a) 28 (b) 5 (c) 0 (d) 36 (e) 7 2. Find 2 cos t dt. (a) 2 sin t + C (b) 2 sin t + C (c) 2 cos t + C (d) 2 cos t

More information

LECTURE 5: APPLICATIONS TO CRYPTOGRAPHY AND COMPUTATIONS

LECTURE 5: APPLICATIONS TO CRYPTOGRAPHY AND COMPUTATIONS LECTURE 5: APPLICATIONS TO CRYPTOGRAPHY AND COMPUTATIONS Modular arithmetics that we have discussed in the previous lectures is very useful in Cryptography and Computer Science. Here we discuss several

More information

Math 1160 Final Review (Sponsored by The Learning Center) cos xcsc tan. 2 x. . Make the trigonometric substitution into

Math 1160 Final Review (Sponsored by The Learning Center) cos xcsc tan. 2 x. . Make the trigonometric substitution into Math 60 Final Review (Sponsored by The Learning Center). Simplify cot csc csc. Prove the following identities: cos csc csc sin. Let 7sin simplify.. Prove: tan y csc y cos y sec y cos y cos sin y cos csc

More information

Title Project Summary

Title Project Summary Title Project Summary The aim of the project is an estimation theory of those special functions of analysis called zeta functions after the zeta function of Euler (1730). The desired estimates generalize

More information

x s 1 e x dx, for σ > 1. If we replace x by nx in the integral then we obtain x s 1 e nx dx. x s 1

x s 1 e x dx, for σ > 1. If we replace x by nx in the integral then we obtain x s 1 e nx dx. x s 1 Recall 9. The Riemann Zeta function II Γ(s) = x s e x dx, for σ >. If we replace x by nx in the integral then we obtain Now sum over n to get n s Γ(s) = x s e nx dx. x s ζ(s)γ(s) = e x dx. Note that as

More information

Topic Contents. Factoring Methods. Unit 3: Factoring Methods. Finding the square root of a number

Topic Contents. Factoring Methods. Unit 3: Factoring Methods. Finding the square root of a number Topic Contents Factoring Methods Unit 3 The smallest divisor of an integer The GCD of two numbers Generating prime numbers Computing prime factors of an integer Generating pseudo random numbers Raising

More information

CPSC 467b: Cryptography and Computer Security

CPSC 467b: Cryptography and Computer Security Outline Quadratic residues Useful tests Digital Signatures CPSC 467b: Cryptography and Computer Security Lecture 14 Michael J. Fischer Department of Computer Science Yale University March 1, 2010 Michael

More information

Numerical method for approximating the solution of an IVP. Euler Algorithm (the simplest approximation method)

Numerical method for approximating the solution of an IVP. Euler Algorithm (the simplest approximation method) Section 2.7 Euler s Method (Computer Approximation) Key Terms/ Ideas: Numerical method for approximating the solution of an IVP Linear Approximation; Tangent Line Euler Algorithm (the simplest approximation

More information

Theorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.

Theorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x. Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural

More information

Elliptic Curve Cryptography

Elliptic Curve Cryptography Areas for Discussion Elliptic Curve Cryptography Joseph Spring Department of Computer Science 7COM1027 - Distributed Systems Security Lecture - Elliptic Curves 1 1 Motivation Elliptic Curves Security of

More information

MTH 2032 Semester II

MTH 2032 Semester II MTH 232 Semester II 2-2 Linear Algebra Reference Notes Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education December 28, 2 ii Contents Table of Contents

More information

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states

More information

CPSC 467: Cryptography and Computer Security

CPSC 467: Cryptography and Computer Security CPSC 467: Cryptography and Computer Security Michael J. Fischer Lecture 14 October 23, 2017 CPSC 467, Lecture 14 1/42 Computing in Z n Modular multiplication Modular inverses Extended Euclidean algorithm

More information

A class of Dirichlet series integrals

A class of Dirichlet series integrals A class of Dirichlet series integrals J.M. Borwein July 3, 4 Abstract. We extend a recent Monthly problem to analyse a broad class of Dirichlet series, and illustrate the result in action. In [5] the following

More information

EXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS. M. Aslam Chaudhry. Received May 18, 2007

EXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS. M. Aslam Chaudhry. Received May 18, 2007 Scientiae Mathematicae Japonicae Online, e-2009, 05 05 EXTENDED RECIPROCAL ZETA FUNCTION AND AN ALTERNATE FORMULATION OF THE RIEMANN HYPOTHESIS M. Aslam Chaudhry Received May 8, 2007 Abstract. We define

More information

Odd Primes. Theory W: Structure and organization of odd primes (8th problem of Hilbert) mathscience.tsoft .com

Odd Primes. Theory W: Structure and organization of odd primes (8th problem of Hilbert) mathscience.tsoft .com T-Soft@mail mathscience.tsoftemail.com Odd Primes Theory W: Structure and organization of odd primes (8th problem of Hilbert) WOLF François and WOLF Marc PhDs in materials science Ceramists engineers IT

More information

MATH 320, WEEK 6: Linear Systems, Gaussian Elimination, Coefficient Matrices

MATH 320, WEEK 6: Linear Systems, Gaussian Elimination, Coefficient Matrices MATH 320, WEEK 6: Linear Systems, Gaussian Elimination, Coefficient Matrices We will now switch gears and focus on a branch of mathematics known as linear algebra. There are a few notes worth making before

More information

Arithmétique et Cryptographie Asymétrique

Arithmétique et Cryptographie Asymétrique Arithmétique et Cryptographie Asymétrique Laurent Imbert CNRS, LIRMM, Université Montpellier 2 Journée d inauguration groupe Sécurité 23 mars 2010 This talk is about public-key cryptography Why did mathematicians

More information

Mathematics 309 Conic sections and their applicationsn. Chapter 2. Quadric figures. ai,j x i x j + b i x i + c =0. 1. Coordinate changes

Mathematics 309 Conic sections and their applicationsn. Chapter 2. Quadric figures. ai,j x i x j + b i x i + c =0. 1. Coordinate changes Mathematics 309 Conic sections and their applicationsn Chapter 2. Quadric figures In this chapter want to outline quickl how to decide what figure associated in 2D and 3D to quadratic equations look like.

More information

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim

More information

The Derivative of a Function Measuring Rates of Change of a function. Secant line. f(x) f(x 0 ) Average rate of change of with respect to over,

The Derivative of a Function Measuring Rates of Change of a function. Secant line. f(x) f(x 0 ) Average rate of change of with respect to over, The Derivative of a Function Measuring Rates of Change of a function y f(x) f(x 0 ) P Q Secant line x 0 x x Average rate of change of with respect to over, " " " " - Slope of secant line through, and,

More information

Calculus w/applications Prerequisite Packet Paint Branch High School Math Department

Calculus w/applications Prerequisite Packet Paint Branch High School Math Department Updated 6/014 The problems in this packet are designed to help you review topics from previous math courses that are important to your success in Calculus with Applications. It is important that you take

More information

9 Knapsack Cryptography

9 Knapsack Cryptography 9 Knapsack Cryptography In the past four weeks, we ve discussed public-key encryption systems that depend on various problems that we believe to be hard: prime factorization, the discrete logarithm, and

More information

Series Primes in Binary

Series Primes in Binary American Journal of Applied Mathematics and Statistics, 204, Vol. 2, No. 2, 60-65 Available online at http://pubs.sciepub.com/ajams/2/2/2 Science and Education Publishing DOI:0.269/ajams-2-2-2 Series Primes

More information

Randomness in Number Theory

Randomness in Number Theory Randomness in Number Theory Peter Sarnak Mahler Lectures 2011 Number Theory Probability Theory Whole numbers Random objects Prime numbers Points in space Arithmetic operations Geometries Diophantine equations

More information

CPSC 467b: Cryptography and Computer Security

CPSC 467b: Cryptography and Computer Security CPSC 467b: Cryptography and Computer Security Michael J. Fischer Lecture 9 February 14, 2013 CPSC 467b, Lecture 9 1/42 Integer Division (cont.) Relatively prime numbers, Z n, and φ(n) Computing in Z n

More information

Quantum Computation and Communication

Quantum Computation and Communication Tom Lake tswsl1989@sucs.org 16/02/2012 quan tum me chan ics: The branch of mechanics that deals with the mathematical description of the motion and interaction of subatomic particles - OED quan tum me

More information

THE RIEMANN HYPOTHESIS: IS TRUE!!

THE RIEMANN HYPOTHESIS: IS TRUE!! THE RIEMANN HYPOTHESIS: IS TRUE!! Ayman MACHHIDAN Morocco Ayman.mach@gmail.com Abstract : The Riemann s zeta function is defined by = for complex value s, this formula have sense only for >. This function

More information

First, let me recall the formula I want to prove. Again, ψ is the function. ψ(x) = n<x

First, let me recall the formula I want to prove. Again, ψ is the function. ψ(x) = n<x 8.785: Analytic Number heory, MI, spring 007 (K.S. Kedlaya) von Mangoldt s formula In this unit, we derive von Mangoldt s formula estimating ψ(x) x in terms of the critical zeroes of the Riemann zeta function.

More information

Lecture Notes for Math 251: ODE and PDE. Lecture 30: 10.1 Two-Point Boundary Value Problems

Lecture Notes for Math 251: ODE and PDE. Lecture 30: 10.1 Two-Point Boundary Value Problems Lecture Notes for Math 251: ODE and PDE. Lecture 30: 10.1 Two-Point Boundary Value Problems Shawn D. Ryan Spring 2012 Last Time: We finished Chapter 9: Nonlinear Differential Equations and Stability. Now

More information

Math 141: Lecture 19

Math 141: Lecture 19 Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,

More information

MINIMAL NORMAL AND COMMUTING COMPLETIONS

MINIMAL NORMAL AND COMMUTING COMPLETIONS INTERNATIONAL JOURNAL OF INFORMATION AND SYSTEMS SCIENCES Volume 4, Number 1, Pages 5 59 c 8 Institute for Scientific Computing and Information MINIMAL NORMAL AND COMMUTING COMPLETIONS DAVID P KIMSEY AND

More information

The Definite Integral. Day 5 The Fundamental Theorem of Calculus (Evaluative Part)

The Definite Integral. Day 5 The Fundamental Theorem of Calculus (Evaluative Part) The Definite Integral Day 5 The Fundamental Theorem of Calculus (Evaluative Part) Practice with Properties of Integrals 5 Given f d 5 f d 3. 0 5 5. 0 5 5 3. 0 0. 5 f d 0 f d f d f d - 0 8 5 F 3 t dt

More information

II. The Machinery of Quantum Mechanics

II. The Machinery of Quantum Mechanics II. The Machinery of Quantum Mechanics Based on the results of the experiments described in the previous section, we recognize that real experiments do not behave quite as we expect. This section presents

More information

Math 231 Final Exam Review

Math 231 Final Exam Review Math Final Eam Review Find the equation of the line tangent to the curve 4y y at the point (, ) Find the slope of the normal line to y ) ( e at the point (,) dy Find d if cos( y) y 4 y 4 Find the eact

More information

On positivity of Fourier transforms

On positivity of Fourier transforms On positivity of Fourier transforms by E.O. Tuck Applied Mathematics The University of Adelaide AUSTRALIA 55 April 1, 26 Abstract This note concerns Fourier transforms on the real positive line. In particular,

More information

Proof the Riemann Hypothesis

Proof the Riemann Hypothesis Proof the Riemann Hypothesis P.M. Mazurkin * Doctor of Engineering Science, Academician of RANS, member of EANS, Volga Region State Technological University, Russia Abstract In the proof of the correctness

More information

LESSON 35: EIGENVALUES AND EIGENVECTORS APRIL 21, (1) We might also write v as v. Both notations refer to a vector.

LESSON 35: EIGENVALUES AND EIGENVECTORS APRIL 21, (1) We might also write v as v. Both notations refer to a vector. LESSON 5: EIGENVALUES AND EIGENVECTORS APRIL 2, 27 In this contet, a vector is a column matri E Note 2 v 2, v 4 5 6 () We might also write v as v Both notations refer to a vector (2) A vector can be man

More information

CRYPTOGRAPHIC PROTOCOLS 2015, LECTURE 2

CRYPTOGRAPHIC PROTOCOLS 2015, LECTURE 2 CRYPTOGRAPHIC PROTOCOLS 2015, LECTURE 2 assumptions and reductions Helger Lipmaa University of Tartu, Estonia MOTIVATION Assume Alice designs a protocol How to make sure it is secure? Approach 1: proof

More information

Math 412: Number Theory Lecture 13 Applications of

Math 412: Number Theory Lecture 13 Applications of Math 412: Number Theory Lecture 13 Applications of Gexin Yu gyu@wm.edu College of William and Mary Partition of integers A partition λ of the positive integer n is a non increasing sequence of positive

More information

Before giving the detailed proof, we outline our strategy. Define the functions. for Re s > 1.

Before giving the detailed proof, we outline our strategy. Define the functions. for Re s > 1. Chapter 7 The Prime number theorem for arithmetic progressions 7. The Prime number theorem We denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.. We have π( as. log Before

More information

The zeta function, L-functions, and irreducible polynomials

The zeta function, L-functions, and irreducible polynomials The zeta function, L-functions, and irreducible polynomials Topics in Finite Fields Fall 203) Rutgers University Swastik Kopparty Last modified: Sunday 3 th October, 203 The zeta function and irreducible

More information

MTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education

MTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education MTH 3 Linear Algebra Study Guide Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education June 3, ii Contents Table of Contents iii Matrix Algebra. Real Life

More information

Private Key Cryptography. Fermat s Little Theorem. One Time Pads. Public Key Cryptography

Private Key Cryptography. Fermat s Little Theorem. One Time Pads. Public Key Cryptography Fermat s Little Theorem Private Key Cryptography Theorem 11 (Fermat s Little Theorem): (a) If p prime and gcd(p, a) = 1, then a p 1 1 (mod p). (b) For all a Z, a p a (mod p). Proof. Let A = {1, 2,...,

More information

Some linear transformations on R 2 Math 130 Linear Algebra D Joyce, Fall 2013

Some linear transformations on R 2 Math 130 Linear Algebra D Joyce, Fall 2013 Some linear transformations on R 2 Math 3 Linear Algebra D Joce, Fall 23 Let s look at some some linear transformations on the plane R 2. We ll look at several kinds of operators on R 2 including reflections,

More information

An Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD

An Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD An Invitation to Modern Number Theory Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Foreword Preface Notation xi xiii xix PART 1. BASIC NUMBER THEORY

More information

CRYPTOGRAPHIC PROTOCOLS 2014, LECTURE 2

CRYPTOGRAPHIC PROTOCOLS 2014, LECTURE 2 CRYPTOGRAPHIC PROTOCOLS 2014, LECTURE 2 assumptions and reductions Helger Lipmaa University of Tartu, Estonia MOTIVATION Assume Alice designs a protocol How to make sure it is secure? Approach 1: proof

More information

. In particular if a b then N(

. In particular if a b then N( Gaussian Integers II Let us summarise what we now about Gaussian integers so far: If a, b Z[ i], then N( ab) N( a) N( b). In particular if a b then N( a ) N( b). Let z Z[i]. If N( z ) is an integer prime,

More information

Admin. ! Will post sample questions soon. 1. Choose a bit-length k. 2. Choose two primes p and q which can be represented with at most k bits

Admin. ! Will post sample questions soon. 1. Choose a bit-length k. 2. Choose two primes p and q which can be represented with at most k bits Admin Assignment 6 Midterm reviews Tue & Wed! Will post sample questions soon ENCRYPTION TAKE 2: PRACTICAL DETAILS Assignment 7 Office hours end today at 3:40 (instead of 4) David Kauchak CS52 Spring 2016

More information

Two Articles Proving and Disproving the Riemann Conjecture

Two Articles Proving and Disproving the Riemann Conjecture From the SelectedWorks of James T Struck Spring May 30, 2018 Two Articles Proving and Disproving the Riemann Conjecture James T Struck Available at: https://works.bepress.com/james_struck/76/ Two Articles

More information

PROBLEMS In each of Problems 1 through 12:

PROBLEMS In each of Problems 1 through 12: 6.5 Impulse Functions 33 which is the formal solution of the given problem. It is also possible to write y in the form 0, t < 5, y = 5 e (t 5/ sin 5 (t 5, t 5. ( The graph of Eq. ( is shown in Figure 6.5.3.

More information

Math 304 Answers to Selected Problems

Math 304 Answers to Selected Problems Math Answers to Selected Problems Section 6.. Find the general solution to each of the following systems. a y y + y y y + y e y y y y y + y f y y + y y y + 6y y y + y Answer: a This is a system of the

More information

a) i b) ii c) iii d) i and ii e) ii and iii a) b) c) d) e)

a) i b) ii c) iii d) i and ii e) ii and iii a) b) c) d) e) Math Field Day 07 Page Suppose the graph of a line has a negative y intercept and a positive intercept If the slope is given by m, which of the following could be true? i m > 0 ii m < 0 iii m = 0 a) i

More information

Randomness in Number Theory *

Randomness in Number Theory * Randomness in Number Theory * Peter Sarnak Asia Pacific Mathematics Newsletter Number Theory Probability Theory Mahler (953): Whole numbers Random objects Prime numbers Points in space Arithmetic operations

More information

arxiv: v2 [math.gm] 24 May 2016

arxiv: v2 [math.gm] 24 May 2016 arxiv:508.00533v [math.gm] 4 May 06 A PROOF OF THE RIEMANN HYPOTHESIS USING THE REMAINDER TERM OF THE DIRICHLET ETA FUNCTION. JEONWON KIM Abstract. The Dirichlet eta function can be divided into n-th partial

More information

Ma/CS 6a Class 2: Congruences

Ma/CS 6a Class 2: Congruences Ma/CS 6a Class 2: Congruences 1 + 1 5 (mod 3) By Adam Sheffer Reminder: Public Key Cryptography Idea. Use a public key which is used for encryption and a private key used for decryption. Alice encrypts

More information