Discrete Math 4.1.2 Modular Arithmetic

Показать описание

Kimberly Brehm

Рекомендации по теме

Комментарии

Oh my god, using a number line is GENIUS! That cleared away ALL the confusion the moment you started going into it. I'll show all my friends this

workingjoe

Kimberly, I don't know if you are aware of how many lives you've saved hahaha.
Just want to appreciate very much your work and hopefully life rewards you back with all the good you have done to too many students!!

agustintamagnone

2:15 "is a and b equivalent in the world of mod m" I received enlightenment ! all my confusion about this bracket thing around the mod disappeared !!

whiteheadiceprince

For the proof starting at 13:15, I was going to recommend if a congruent to b mod m, then m divides a - b and there exists an integer x such that a - b = mx. Little did I know, you used a much faster formula related to mod, but this proof was in my last test. Thank you for the upload and all of the other great content in this playlist.

Primitive_Code

pleas I don't get the reason why for -5/3, the reminder is going to be 1

akpal

i am from egypt and you are the best. keep it going please..

mdalaanmans

Thank you. Great explanation. I get it now.

TheRoddie

Thank you so much. I will share this video with my classmates.

mervynns

The divides relation is a true or false statement. I think it would have been better if you explained in your slide at ~8 min just using the division algorithm instead of the divides relation

SayheeKim

How is 4 | -4 true? It would mean 4c = -4 and according to divisibility c has to be a positive integer and c = -1

zedisnotded

hi kimberly i got a question, im very confused on how at 15:39 the division algorithm is b = a + km . so a is the remainder here?? i tried getting there using division by saying okay we have m | (a-b) so a-b = km where k in Z and therefore a = km + b. im still stuck on how you got that division algorithm

pedramhaqiqi

Professor, A quick question. In the proof of a+c and ac. How does a = b(mod m) become b =a + km. Shouldn't it by definition be a = b + km.

nishanthchaganty

My professor did a practice problem in class for a mod m=b mod m. Using your method it gave me false but my professor got true. The problem was 172 (congruence symbol) 177 (mod 5). Can you please explain again what makes this problem true? What I understood from the video is you determine congruency based on if the remainders are the same.

Athletichick

Aren't we gonna talk about that she did the class even she got Flu hahaha.
Thanks <3

M_VERICK

Discrete Math 4.1.2 Modular Arithmetic

Discrete Math - 4.1.2 Modular Arithmetic

Discrete Math 4.1.2 Modular Arithmetic

[Discrete Mathematics] Modular Arithmetic

Modular Arithmetic (Part 1)

What is Modular Arithmetic - Introduction to Modular Arithmetic - Cryptography - Lesson 2

What does a ≡ b (mod n) mean? Basic Modular Arithmetic, Congruence

Solving congruences, 3 introductory examples

Basics of Modular Arithmetic

@btechmathshub7050 EUCLIDEAN ALGORITHM -Number Theory - MFCS - DMS - DMGT Proof with example

DIVISIBILITY - DISCRETE MATHEMATICS

Modular Arithmetic Equations

Discrete Math - 4.1.1 Divisibility

Extended Euclidean Algorithm and Inverse Modulo Tutorial

How To Find The Inverse of a Number ( mod n ) - Inverses of Modular Arithmetic - Example

Discrete Math 4.1: Divisibility & Modular Arithmetic

Discrete Structures: Modular arithmetic

Discrete Mathematics Rosen Section 4 1 4 2

Congruence Modulo m

Number Theory | Linear Congruence Example 2

IIT Bombay Lecture Hall | IIT Bombay Motivation | #shorts #ytshorts #iit

Discrete Math 4.2 Modular Arithmetic (Part 2)

Solving Linear Congruences, Modular Arithmetic

Discrete Math 4.1.1 Divisibility

Discrete Math - 4.4.1 Solving Linear Congruences Using the Inverse