Day 21 in
Mat310
Last time
: Exam 2
Next time
: Application to Cryptography
Today
:
Return Exam 2
Test 2
Test 2 Key
Mean: 36.6
SD: 5.4
Problems:
Too many didn't know definitions (e.g. complete set of residues mod n) or theorems (e.g. Fermat's Little theorem, and then how to apply it).
I told you that there would be a problem from the 5.4 homework: I gave you problem #5. If you didn't nail it, why not?
Some had problems with the laws of exponents.
Some had problems with the factorial function.
Some demonstrated only half of an "if and only if" proof.
Working independently on homework paid off: the four best papers all came from people who have clearly been doing their homework independently.
Seeking help paid off: three of the top four have been in my office for help on homework problems.
Next Homework?
Let's make the 6.1 homework due Thursday.
In a week's time, hand in only the 7.2 portion of the 7.2/7.3 set:
7.2 #1, 3, 5, 6
Euler's Phi Function
section 7.2 summary
Section 7.2 Examples, p. 133:
#4a, b
#8
#9a
And the generalization of Fermat's Little Theorem:
section 7.3 summary
Section 7.3 Examples, p. 138:
#1a
#4
#10
Links:
Euler and Voltaire
Website maintained by
Andy Long
. Comments appreciated.