Tag Archives: basic

Homework (29 Oct 2011)

The homework for last week was a little harder than the prior one: Let n be a positive integer, . Prove that the sum of the divisors of n is a multiple of 24. Let N = 210 × 39 … Continue reading

Posted in Homework | Tagged , , | Leave a comment

Number Theory Notes (22 Oct 2011) – Part III

Finally, we shall solve two more problems – the last problem is rather surprising since at first glance, it doesn’t appear to involve congruences. Problem 4 : Prove that if n is a perfect square, then . Solution : this is rather … Continue reading

Posted in Notes | Tagged , , | Leave a comment

Number Theory Notes (22 Oct 2011) – Part II

Now we will solve actual problems with the theory we’ve just learnt. Problem 1 : Find all integers x such that x ÷ 5 has remainder 3, x ÷ 7 has remainder 6 and x ÷ 9 has remainder 2. Solution : This can be … 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