This preview shows page 1. Sign up to view the full content.
Unformatted text preview: p divides ab and p is prime, either p divides a or p divides b ). Congruence classes. You should be able to perform arithmetic operations with the congruence classes (addition, multiplication, powers), solve congruences ax = b mod n, (1) and systems of congruences (using Chinese Remainder Theorem) x = a mod m, x = b mod n. (2) The operations with powers of congruence classes can be made directly or with the usage of Fermats and Eulers theorems. Mathematical induction. You should be able to prove statements using induction, formulate the base case and the step of induction and prove them. Basics of public key codes. You may be asked to encode or decode a message using the Eulers Theorem and basic RSAtype algorithm. 1...
View
Full
Document
This note was uploaded on 01/25/2012 for the course MAT 312 taught by Professor Bescher during the Summer '08 term at SUNY Stony Brook.
 Summer '08
 BESCHER
 Algebra, Number Theory, Division, Remainder, Integers

Click to edit the document details