# Sorry, we couldn't find any content for this search.

Try changing your keywords or filters.

UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture Notes - Lecture 18: Euclidean Algorithm, Linear Combination, Prime Number

OC25203513 Page
0
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
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture 17: Power Tables, Fermat’s Theorem & Euler’s Theorem

OC25203512 Page
0
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture 15: Exponents in Modules

OC25203512 Page
0
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
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture Notes - Lecture 12: Modular Arithmetic, Euclidean Algorithm, Multiplication Table

OC25203513 Page
0
Mata02 - lecture 12 - solving modular arithmetic problems, euclidean algorithm, One pattern is that there are no numbers (let"s call this. B") such tha
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture Notes - Lecture 11: Modular Arithmetic, Multiplication Table

OC25203512 Page
0
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
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture 9: Phi (Φ) Function and Modular Arithmetic

OC25203512 Page
0
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
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture 8: Composite Consecutive Natural Numbers, Twin Primes, Positive Divisors and Euler (Φ) Function

OC25203513 Page
0
Mata02 - lecture 8 - composite consecutive natural numbers, twin primes, positive. Divisors and euler ( ) function (n + 1)! + n is divisible by n" (n +
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture 7: Prime/Composite Numbers & Eratosthenes Sieve

OC25203512 Page
0
Mata02 - lecture 7 - prime/composite numbers & eratosthenes sieve. A prime number is a natural number greater than 1, that are only divisible by 1 and
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture Notes - Lecture 6: Prime Number, Euclidean Algorithm, Linear Combination

OC25203513 Page
0
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture 5: Water Jug Riddle & Euclidean Algorithm

OC25203512 Page
0
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture 4: Prime/Composite Numbers, GCF, Euclidean Algorithm

OC25203513 Page
0
View Document
UTSCMATA02H3Sophie ChrysostomouWinter

## MATA02H3 Lecture 3: Factors, Multiples, LCM

OC25203512 Page
0
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
View Document

## Get Study Guides at University of Toronto Scarborough

We are currently building a library of Study Guides for courses at University of Toronto Scarborough. Request and we’ll let you know once it’s available.

Study Guides (380,000)
CA (150,000)
UTSC (9,000)
MATA02H3 (0)