So many admin announcements this time of year! Please read back through the last 4 daily posts to make sure you didn’t miss anything.
Written retakes are due on canvas by the exam. (Tests 1-3)
I’d love it if you could provide some feedback on the poster assignment (my first time doing it this year) and other aspects of the course: two question anonymous survey here: https://forms.gle/fncVHARYpbxznJHL8 (optional but appreciated).
Please do your FCQs also!
Now a few review problems. Do you remember Sunzi/Chinese Remainder? Try out this Chinese Remainder Theorem problem, by hand: x = 3 mod 214 and x = 11 mod 495. Show all the steps of the process, including the extended euclidean algorithm. You can use the computer to do modular arithmetic for you (e.g. multiplying things if needed), but show the steps as if doing it by hand.
Now, use Sunzi to find all the square roots of 3 modulo 143. There should be 4. Hint: you can break 143 = 13*11.
Now use Sunzi to find all the square roots of 33 modulo 143. There should be 2.
Can you create a similar example with 1 square root. With none?