Theorems: Proofs of the infinitude of primes. Binet formula. Fermat's Two-Square theorem. Dirichlet's theorem. The multiplicative function theorems. Chebychev's estimate proof.
What kind of questions: I expect to see proofs about primes, their infinitude and form. Fib. numbers. Binomials. Problems dealing with the number of primes less than x.
Better understand: I feel most unsure about what for the questions will take. Going over that would be very helpful. Other than that if you could show problem 3.13 from the book, that is the one homework problem I still have no clue about the solution.
Rest of the semester: I would be interested in any parts of number theory that could be applied to cryptography, and most especially experimental cryptography (aka, not just AES, eliptic curves, RSA, etc.). Maybe stuff dealing with fully homomorphic encryption.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment