{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lec-08-primality

# lec-08-primality - CSE565 Computer Security Lecture 8...

This preview shows pages 1–6. Sign up to view the full content.

9/23/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 8.1 CSE565: Computer Security Lecture 8 Number Theory Concepts Shambhu Upadhyaya University at Buffalo Buffalo, New York 14260

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
9/23/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 8.2 Acknowledgments Material is drawn from Lawrie Brown’s slides
9/23/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 8.3 Prime Numbers Prime numbers only have divisors of 1 and self they cannot be written as a product of other numbers note: 1 is prime, but is generally not of interest E.g., 2,3,5,7 are prime, 4,6,8,9,10 are not Prime numbers are central to number theory List of prime number less than 200 is: 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
9/23/10 UB Fall 2010 CSE565: S. Upadhyaya Lec 8.4 Prime Factorization To factor a number n is to write it as a product of other numbers: n=a × b × c Note that factoring a number is relatively hard compared to multiplying the factors together to generate the number The prime factorization of a number n is when it is written as a product of primes E.g., 91=7×13 ; 3600=2 4 ×3 2 ×5 2
9/23/10 UB Fall 2010 CSE565: S. Upadhyaya

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 14

lec-08-primality - CSE565 Computer Security Lecture 8...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online