SU-MATH109 Problem Set 1
Last edited: August 8, 2025SU-MATH109 SEP272023
Last edited: August 8, 2025Key Sequence
New Definitions
Results and Their Proofs
- principle of induction
- primes
- division and greatest common divisor
- Euclidean Algorithm and some euclid lemma linked below in fundamental theorem of arithmetic
Questions for Jana
Interesting Factoids
SU-MATH109 SEP272023
Last edited: August 8, 2025\begin{equation} \mathbb{N} = \{0, 1,2,3 \dots \} \end{equation}
the set of natural numbers. start from 0.
\begin{equation} \mathbb{Z} = \{\dots, -2, -1, 0,1,2, \dots \} \end{equation}
the set of integers. natural language and their negatives
Key Sequence
- first, we built the ground work of principle of induction in order to construct the WOP
- we defined division, and formalized the algorithm for doing so
- we then defined the greatest common divisor, and the fact that greatest common divisor is a linear combination
- we then constructed the idea of prime numbers, coprimes, and showed that There are infinitely many primes
- Finally, we used yet another lemma from Euler to build the fundamental theorem of arithmetic
New Definitions
Results and Their Proofs
SU-MATH109 SEP292023
Last edited: August 8, 2025Key Sequence
New Definitions
Results and Their Proofs
Questions for Jana
- why is it that adding all the digits work for \(\ \text{mod}\ 9\). I still don’t get it.
- in re Chinese Remainder Theorem: is there any case in which \(a\ \text{mod}\ b\) is not unique?
Interesting Factoids
SU-MATH53 FEB022024
Last edited: August 8, 20252nd order linear inhomogeneous: non-homogeneous linear differential equation