🏷️ LIMITED TIME OFFER: GET 20% OFF GRADE+ YEARLY SUBSCRIPTION →
Log in

Verified Documents at University of Toronto Scarborough

Browse the full collection of course materials, past exams, study guides and class notes for MATA02H3 - The Magic of Numbers at University of Toronto Scarborough verified by our …
Get Access
PROFESSORS
All Professors
All semesters
Sophie Chrysostomou
winter
12

Verified Documents for Sophie Chrysostomou

Class Notes

Taken by our most diligent verified note takers in class covering the entire semester.
MATA02H3 Lecture 3: Factors, Multiples, LCM
Mata02 - lecture 3 - factors, multiples, lcm. Let"s say i have 2 natural numbers (natural numbers are positive integers). These 2 numbers will be varia
2176
MATA02H3 Lecture 4: Prime/Composite Numbers, GCF, Euclidean Algorithm
3171
MATA02H3 Lecture 5: Water Jug Riddle & Euclidean Algorithm
2161
MATA02H3 Lecture Notes - Lecture 6: Prime Number, Euclidean Algorithm, Linear Combination
3148
MATA02H3 Lecture 7: Prime/Composite Numbers & Eratosthenes Sieve
Mata02 - lecture 7 - prime/composite numbers & eratosthenes sieve. A prime number is a natural number greater than 1, that are only divisible by 1
2231
MATA02H3 Lecture 8: Composite Consecutive Natural Numbers, Twin Primes, Positive Divisors and Euler (Φ) Function
Mata02 - lecture 8 - composite consecutive natural numbers, twin primes, positive. Divisors and euler ( ) function (n + 1)! + n is divisible by n" (n +
3201
MATA02H3 Lecture 9: Phi (Φ) Function and Modular Arithmetic
Mata02 - lecture 9 - phi ( ) function and modular arithmetic (february 4th, 2019) Let"s say n" is a natural number and: n=p 1 a 1 p 2 a 2 p 3 a 3 p 4 a
2167
MATA02H3 Lecture Notes - Lecture 11: Modular Arithmetic, Multiplication Table
Mata02 - lecture 11 - modular arithmetic, modular tables (february 11th, 2019) If n" is a positive integer, then for an integer m", the value of m mod
2221
MATA02H3 Lecture Notes - Lecture 12: Modular Arithmetic, Euclidean Algorithm, Multiplication Table
Mata02 - lecture 12 - solving modular arithmetic problems, euclidean algorithm, One pattern is that there are no numbers (let"s call this. B") such tha
3312
MATA02H3 Lecture 15: Exponents in Modules
Mata02 - lecture 15 - exponents in modules (february 25th, 2019) Due to modules, there are specific things we can see based on exponents. Let"s start w
2129
MATA02H3 Lecture 17: Power Tables, Fermat’s Theorem & Euler’s Theorem
2120
MATA02H3 Lecture Notes - Lecture 18: Euclidean Algorithm, Linear Combination, Prime Number
Mata02 - lecture 18 - solutions to powers in modules, euclidean arithmetic, fermat"s. Question : how do you find the solutions of. K a: check if p" is
3238