4383_Notes_4o4_fill

4383_Notes_4o4_fill - When b = 1 the equivalence class is called the multiplicative inverse in ℤ Examples What about SYSTEMS of linear congruence

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

Number Theory Chapter 4 Linear Congruence and the Chinese Remainder Theorem Linear Congruence Given integers a and b and n>1, find a solution to the equation ( 29 mod ax b n . What this means: Congruent solutions versus incongruent solutions: Solutions in terms of the equivalence classes mod n: We can think of this equation as one in the arithmetic of find an integer x such that the equation [a] * [x] = [b]

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

View Full Document
The relationship between this and linear Diophantine equations When is there a solution?
If gcd(a, n) = 1, the linear equation ( 29 mod ax b n has a unique solution modulo n. Or, there exists a unique element [x] such that [a] * [x] = [b]

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

View Full Document

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.

Unformatted text preview: When b = 1 the equivalence class is called the multiplicative inverse in ℤ Examples: What about SYSTEMS of linear congruence equations? ( 29 ( 29 ( 29 1 1 1 2 2 2 mod mod ... mod k a x b m ≡ ≡ ≡ When does it have a solution? Why can we reduce this to a system where all the moduli are relatively prime? Early Chinese contributions to this type of problem occur in the literature as early as the first century AD – so the method of solution is called the Chinese Remainder Theorem. The Chinese Remainder Theorem Example Example:...
View Full Document

This note was uploaded on 02/21/2012 for the course MATH 4383 taught by Professor Flagg during the Spring '09 term at University of Houston.

Page1 / 7

4383_Notes_4o4_fill - When b = 1 the equivalence class is called the multiplicative inverse in ℤ Examples What about SYSTEMS of linear congruence

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

View Full Document
Ask a homework question - tutors are online