Week7 - Number Theory #

This week we cover the entire number theory chapter. We talk about gcd, lcm, primes, divisors, modulo calculations and more. Then we practice some (old exam) excercises. Lastly we learn the Euclid Algorithm for finding the gcd of two numbers.

IMPORTANT: The class next week will NOT take place on monday! I will instead hold it on Tuesday, Novemember 11 at 16:15 in LFW B3. If you cannot attend: If you are not inscribed in my group, visit the tutorial you are inscribed in. Everyone in my group: If your last name starts with A-M then go to CHN D42, if it starts with N-Z go to LFW C11 (both at the usual time 16:15 on Monday).

Resources #

Kahoot: link
Exercises + Solutions: pdf
Intuition Drawings: pdf
(Extended) Euclid Algorithm: pdf
CRT Brute Force Method: pdf
Slides: pdf
Exercise Sheet Questions: link

You can find even more exercises in the books linked here.

Notes on Last Exercise Sheet #

I was surprised by how well they got solved on average!
JUSTIFY EVERY STEP. (I am sloppy in my solutions that I give you, but you need to justify everything!)
If you haven’t already, take a look at 6.6 (a lot of old exam questions are similar)

Exercise Sheet Recommendations #

Pretty much all of them look useful to me. If you don’t have time, then leave out the three-stars.