The Largest Known Prime Number

Slides:

Advertisements

Similar presentations

AKS Implementation of a Deterministic Primality Algorithm

Advertisements

P vs. NP, AKS, RSA: The Acronyms of Mathematics Awareness Month Emily List Wittenberg University Thank you for the introduction.

Presented by Alex Atkins.  An integer p >= 2 is a prime if its only positive integer divisors are 1 and p.  Euclid proved that there are infinitely.

Cryptography and Network Security

Prime Numbers: A Recent Discovery, Secure Communications, and Million Dollar Prizes George T. Gilbert TCU January 29, 2003.

Whiteboardmaths.com © 2004 All rights reserved

Chapter 8 More Number Theory. Prime Numbers Prime numbers only have divisors of 1 and itself They cannot be written as a product of other numbers Prime.

1. What number does the following array represent?

Introduction to Modern Cryptography Lecture 6 1. Testing Primitive elements in Z p 2. Primality Testing. 3. Integer Multiplication & Factoring as a One.

Minimum Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan

CMPT-585 Project Presentation Ayesha Mohiuddin Ramazan Burus Generating Prime Numbers using Grid Computing.

K. -C. Yang and J. -L. Lin National Tsing Hua University

Space-Saving Strategies for Computing Δ-points Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University,

SECTION 5-2 Large Prime Numbers Slide THE INFINITUDE OF PRIMES Slide There is no largest prime number. Euclid proved this around 300 B.C.

1 Mersenne Primes How to generate more prime numbers? Mersenne ( ) generated primes using formula: where p is a prime M 2 = 3; M 3 = 7, M 5 = 31,

Counting Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan

RSA Parameter Generation Bob needs to: - find 2 large primes p,q - find e s.t. gcd(e, Á (pq))=1 Good news: - primes are fairly common: there are about.

 Turn in pg 123  Estimate 3.55 * * 200 = 800  Write 60,890,000,000 in scientific notation.

Minimum Routing Cost Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan.

Analyzing and Testing justified Prime Numbers

SMARTPHONE HARDWARE Mainak Chaudhuri

Primes in P Deterministic polynomial-time algorithm of Agrawal, Kayal and Saxena Presented by Vladimir Braverman.

Multiple Sequence Alignment Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan WWW:

Apple Raises $17 Billion in Record Debt Sale Kun-Mao Chao Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan.

9/22/15UB Fall 2015 CSE565: S. Upadhyaya Lec 7.1 CSE565: Computer Security Lecture 7 Number Theory Concepts Shambhu Upadhyaya Computer Science & Eng. University.

Primes in P Manindra Agrawal Neeraj Kayal Nitin Saxena CS300: Technical Paper review by Arpan Agrawal.

Eye-Tracking Tech Kun-Mao Chao Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan A note.

Donghyun (David) Kim Department of Mathematics and Computer Science North Carolina Central University 1 Chapter 7 Time Complexity Some slides are in courtesy.

Dynamic Programming Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan

Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan

Space-Saving Strategies for Analyzing Biomolecular Sequences Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan.

Hacked A.P. Twitter Kun-Mao Chao Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan A note.

Chapter 4 With Question/Answer Animations 1. Chapter Summary Divisibility and Modular Arithmetic - Sec 4.1 – Lecture 16 Integer Representations and Algorithms.

PRIMES is in P Manindra Agrawal Neeraj Kayal Nitin Saxena Dept of CSE, IIT Kanpur.

Data Structures and Algorithm Analysis Lecture 23

CSE565: Computer Security Lecture 7 Number Theory Concepts

Online Courses A note given in BCC class on May 10, 2016

Chapter 5: Number Theory

Sequence Alignment Kun-Mao Chao (趙坤茂)

Homology Search Tools Kun-Mao Chao (趙坤茂)

A note given in BCC class on March 15, 2016

Introduction to Cryptography

Shortest-Paths Trees Kun-Mao Chao (趙坤茂)

Heaviest Segments in a Number Sequence

A Quick Note on Useful Algorithmic Strategies

A Note on Useful Algorithmic Strategies

Minimum Spanning Trees

Strings and Pointer Arrays

A Note on Useful Algorithmic Strategies

A Note on Useful Algorithmic Strategies

The Theory of Computation

Space-Saving Strategies for Computing Δ-points

A New Storage Record A note given in BCC class on May 7, 2014

Multiple Sequence Alignment

Facebook’s WhatsApp Purchase

Space-Saving Strategies for Computing Δ-points

Space-Saving Strategies for Computing Δ-points

Space-Saving Strategies for Computing Δ-points

Space-Saving Strategies for Analyzing Biomolecular Sequences

Trees Kun-Mao Chao (趙坤茂)

Space-Saving Strategies for Computing Δ-points

Homology Search Tools Kun-Mao Chao (趙坤茂)

Trees Kun-Mao Chao (趙坤茂)

Minimum Spanning Trees

Multiple Sequence Alignment

Space-Saving Strategies for Computing Δ-points

Space-Saving Strategies for Computing Δ-points

Dynamic Programming Kun-Mao Chao (趙坤茂)

Presentation transcript:

The Largest Known Prime Number Kun-Mao Chao (趙坤茂) Department of Computer Science and Information Engineering National Taiwan University, Taiwan A note given in BCC class on May 28, 2014

Mersenne prime a Mersenne prime is a prime number of the form Mn=2n-1. Since 1997, all newly found Mersenne primes have been discovered by the “Great Internet Mersenne Prime Search” (GIMPS), a distributed computing project on the Internet.

The ten largest known prime numbers (as of May 28, 2014) Lucas–Lehmer primality test

AKS primality test A deterministic primality-proving algorithm created and published by Manindra Agrawal, Neeraj Kayal, and Nitin Saxena, computer scientists at the Indian Institute of Technology Kanpur, on August 6, 2002. The algorithm determines whether a number is prime or composite within polynomial time. "PRIMES is in P."