How to Convert a Negative Integer in Modular Arithmetic - Cryptography - Lesson 4

[@JohnSmith-bx4gf]

Reading about this craziness for the last hour and only you could explain it clearly.

[@llawliet1750]

same to me now 2 years after

[@iam_topg]

same man

[@barbaraamedekanya5338]

Same oo

[@RatioBozo69]

Same

[@plebbo14]

Literally seeing everyone else in the same boat as me why aren’t the books as good as teaching this as you You’re so good!

[@trevorbenjamin928]

I know I'm kinda off topic but does anyone know a good website to stream newly released tv shows online ?

[@carmelojerome9214]

@Trevor Benjamin Flixportal xD

[@trevorbenjamin928]

@Carmelo Jerome thank you, I went there and it seems like a nice service :) I appreciate it!!

[@carmelojerome9214]

@Trevor Benjamin you are welcome xD

[@colinjbanks]

Thank you. Explained very well. The best I’ve seen so far.

[@souravraychaudhuri6600]

An easy trick to solve this problem: 1. Ignore the -ve sign on the number (n). 2. Find the remainder(R) when divided by (m). (Just like how the modulo is found for +ve integer) 3. Do m - R (m minus R) to get the final answer for the -ve number (n).

[@elitemaths4994]

Yeah, bro, I thought about the same thing and was just going to write in the comments.

[@oOnewerOo]

could not find a single video in german that explains it, finally i found u and i unterstand every single word and obviously i also check how to solve it.

[@fatyoshirules]

Thank you so much for taking your time to make these videos! They are the best resource I have found here on KZbin when it comes to modular arithmetic!

[@christopherandrewmartin494]

This was so helpful for me as I prepare for my upcoming Discrete Mathematics exam! Thank you.

[@nicholasbraud1986]

Thanks man, you took three minutes to explain what my book tries to in 15 pages of uselessness.

[@obetachristopher8354]

Haaahaaa oh God

[@klabboy13]

You should make more of these on cryptography! This is great!

[@DarkGT]

Thanks Paul, no one teacher can explain it like you. Sadly you didn't make more episodes of Cryptography videos.

[@JustMe-ob3nw]

True

[@qlikviewtraining3012]

You're a great teacher. Reminded of Salman Khan (Khan Academy) .Thank you.

[@sayalideo7823]

Awesome. Please continue adding more tutorials in this playlist. Thanks a lot

[@Allegory101]

Thank you for all these crystal clear videos!

[@trantrungnghia9642]

No no no it just took me 15 minutes to get to another level of DM 😮 you are a Saint

[@jaejoonpark9548]

thank you so much. i was having hard time with understanding negative modulo arithmetic

[@c.kreddy6795]

Sir y r u not uploading videos since 5 years

[@sonofagah2416]

Since nine years

[@dumebiobiaghanwa1998]

I think he is dead😢

[@BenjaminWheeler0510]

Thanks! Needed this for a Discrete Mathematics exam in about an hour.

[@del7920]

Thank you so much! This was such an easy, clear video.

[@aryanrahman3212]

I would like to clarify a thing which confused me: 1. The reason we NEED to get a number that is MORE negative is because if we didn't for example, -50-1=-51, NOTICE THAT THE REMAINDER IS negative 1 not 1, in modulo 10 the range of valid numbers you can have is 0,1,2,3,4,5,6,7,8,9.. right? It cannot be negative so to get the number in that range we must find a number that is MORE NEGATIVE than -51 and then ADD A POSITIVE INTEGER which is in that given set of numbers 0 to 9.

[@fairlymoon448]

oops my bad, found the playlist, (tho i think it should be called modular arithmetic) these vids are fantastic btw! so clear!

[@heek40]

You're a saint

[@RoundCorner93]

Great explanation. Thank you so much!

[@devondevon4366]

4:09 -51= -6x 10 + 9 n=qm + r .. quotient has to change since you keep the mod (10) and the remainder has to be positive, so only quotient would have to change to make the equation -51

[@HuanPhanThai]

Thank the teacher so much. The lecture is very easy to understand.

[@astudilloerika31]

I wish every professor went over every step. I am more of a visual person and some professors just say the steps out loud without displaying the steps on paper

[@amorfati4559]

An easy way to do this: n = a (mod m) -n = b (mod m) where a+b = m Since it is easy to just find n (mod m), all you have to do to find -n (mod m) is take the difference. It is a simple proof to show why this works: Let n = q_1m + r_1 --> q_1 < n Let -n = q_2m +r_2 --> q_2m < -n --> |q_2m| > n --> |q_2| = q_1 +1. If |q_2| = q_1 + 1 q_2 = -q_1 -1. Now, -(-n) = n, so: -((-q_1-1)m + r_2) = q_1m +r_1 r_1 + r_2 = m and since the remainders are the same thing as a and b, we can say that a+b = m.

[@shalindeval8746]

we need more cryptographic videos! please!!

[@goaway135]

thank you, you have saved my day!

[@aaagwz]

Very! very!! awesome work.

[@SageKisura]

Thank God I found this video

[@Engeneeringtips]

Thanks !! It was very clear I finally understand it now

[@dannynguyen8992]

Thank You. Clear and Fast.

[@alaamohammed8722]

thank u so much.. u make much easier🌸

[@joniin9384]

this is an awesome video, appreciations

[@cringegachakidisafatherlessbih]

Miss u bro

[@bornkool]

Thanks for the lesson

[@vanessatolentino5302]

Thank you. It really helped me. ☺️

[@T-She-Go]

Why did you stop making videos😭😭 you're amazing!

[@PiriyaSambandaraksa]

can I just do a floor division on the negative number with m? say I get -13 as d in RSA where p=11 q=5 n=55 phi(n)=40 e = 3 -13 // 40 = -1 -13 - (-40) = 27

[@aldocuomo9738]

GREAT VIDEO. THANKS

[@dscruiter]

aside from practicality or definition (?), why can't we have just -51 = (-5)*10 + (-1), so that R= -1? makes it more symmetrical regarding the positive cases?

[@projectryan88]

That is a very valid question, did you ever find an answer as to why he didn't use that solution? Because now I'm wondering the same thing as it seems also mathematically correct to my eyes though this is all new to me so I could be wrong.

[@a.sathyajothi2580]

Thank you so much sir.

[@cach_dies]

amazing! what happens if the mod is negative, can it be negative?

[@Metareduxxx]

genius

[@davisjohn-d6h]

But when you divide -37 by 5 and 3 by 5, they don't have equal remainders. Shouldn't it be -37=2 (mod5) because then -37/5 gives remainder of 2 and 2/5 gives remainder of 2.

[@reenz3252]

I love you thank you so much

[@zeeshanulhaq4619]

why cant we go with -35 and than add (-2) to get the result.. why should be the product qm always be more negative..?? is this because the reminder can never be negative or any other reason..?

[@mahtabmahdavifar4867]

It was great Thanks!

[@megalolly6140]

Question: What if they become equal? (-416 = 16 x 26)

[@maxinec2325]

thanks for your help

[@muktadanu1962]

u r amazing..

[@osman_gedik]

When I calculate -5 mod 11 than it looks like this: -5 mod 11 -5 = -1 * 11 + 6 But 6 is not the inverse element of -5. It should be 9

[@abhinavmishra9401]

this helped ! thanks

[@ahmadkhader1901]

Why don't we say that reminder is - 1 and the resultant is - 5 So it well looks like that (-5.9) + (-1) = -51

[@chinthanasachin1684]

Thanx a Lot!

[@anassazrour7179]

if b=aq+r than −b=a(−q−1)+a−r we use this formula in morocco

[@Dracstar]

what happened to the patreon video?

[@learnmathtutorials]

Dracstar Oh you noticed. Originally, I set up my Patreon account to allow pledges per video uploaded. Then I talked with a few people about it and it seemed that more people liked the pledge per month option, so I switched the pledge option to be monthly. The Patreon video that I originally made, described the per video pledge option. So I figured I would take it down and redo it later to reflect the per month option and hopefully avoid confusion.

[@learnmathtutorials]

Dracstar My Patreon account is still up at www.patreon.com/learnmathtutorials

[@Dracstar]

Learn Math Tutorials thanks :D

[@mostafanaga5021]

legend

[@xvid6041]

thank u sir

[@christophersedlak1147]

thanks!!!!!!!!!!!!!!!!!!

[@austinbao]

AHHHHH the 1k like feels gud

[@rashmiyadav3048]

Thankyou

[@h.moussa2190]

thank youuuuuuuuuuuuuuuuu

[@sampathkumartallapally5691]

it initiated me again

[@abduljalilisa7754]

Who're the 9 crazy people to dislike this video

[@hugochavez8797]

eres un amor

[@yingliweng9759]

best :)

[@choleedw7469]

Freedom people use Utopia.