Modular Arithmetic 2

Modular Arithmetic 2 - Modular Arithmetic Differences and...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Modular Arithmetic Differences and Similarities Modular arithmetic is very similar to the Arithmetic we are so much used to. In line with the Sylvester's pronouncement , let's write down for the record the differences and similarities found between Euclidean (regular) and Gaussian (modulo) arithmetic. Differences 1. Numbers Euclidean arithmetic operates on infinite set of all integers; Gaussian only works with finite sets {0,1,. ..,N-1} (or with sets of residue classes .) 2. ab = 0 In usual arithmetic, ab = 0 is only possible when either a or b is zero. In Gaussian case we have, e.g., 2×3 = 0 (mod 6), whereas neither 2 = 0 (mod 6) nor 3 = 0 (mod 6). 2 and 3 are zero divisors in the arithmetic modulo 6. Euclidean arithmetic has no zero divisors. Arithmetic modulo a prime, too, has no zero divisors. 3. Polynomial roots Fundamental Theorem of Algebra implies that every polynomial of order n over the field C of complex numbers has exactly n roots. In the Gaussian arithmetic all depends on a
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/11/2010 for the course MATH 311 taught by Professor Coluos during the Spring '10 term at UNMSM.

Page1 / 2

Modular Arithmetic 2 - Modular Arithmetic Differences and...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online