Tag Archives: congruence

Modular Arithmetic Deluxe Edition

[ Background required: standard modular arithmetic. ] Consider the following two problems: Problem 1. Prove that if p > 2 is prime, then when is expressed in lowest terms , m must be a multiple of p. Problem 2. Prove that if … Continue reading

Posted in Notes | Tagged , , , , , | Leave a comment

Number Theory Notes (22 Oct 2011) – Part I

Background required: none. For the first lecture, we shall look at congruence and modular arithmetic. Many of you may have already known (at least on an intuitive level) that square integers can only end in 0, 1, 4, 5, 6, … Continue reading

Posted in Notes | Tagged , , , , | Leave a comment