Video

Next, draw the rest of the owl

God bless you

If i have x value how to get the first number before mod

this video a blessing

0:04 no, that's the null sign, the symbol to denote the empty set. Phi is something else.

what if the x has coeffecients to solve? Like i have this question that goes: 2x congruent 6 mod 14 3x congruent 9 mod 15 5x congruent 20 mod 60 Just confused a little bit, anyways the video was very helpful thank you!

God bless you

You still have a problem with addition, Believe it or not.

I wanna ask for the term of gcd is one, is this term for two problems above or just for modular multiplicative invers?

human

pretty cool explanation

Thanks sir . 2024

Best explanation so far.

Thankyou so much, none of my lecture notes are making sense but this does

Thanks, helped a lot!

so glad i understood absolutely nothing that was said

thanks!

Why did my teacher just skip to teach this bit? Thank you for a good video.

Gcd 15 and45

Another great explanation - this is a fantastic resource. RH is a great educator, someone who breaks it down simply for students, rather than some academics who seem to take pleasure in showing how clever they are by describing things in a complex way!

It's great to find a maths teacher who explains thing simply for us normal mortals! Thank you!

cool

best explanation of this i've seen.

What about 26?

youtube.com/@Enjoying8?si=Oi5M-6A59FbuPh45

The most clear and structural explanation without just using the usual steps without reason like other videos!!! Thank you !😇

The last one was real absurd!❤

Thanks Mate! Great video

very unclear solutions. Just goes direkt to the answer.

extremely informative content out here, would've never figured out how it worked if not your help. Thanks you

im sorry lol but how can anyone say this is a good explanation?? he just says substitute this line with this line?? like which part do i substitute with what lol

I immediately know the answer and this is not the video for me but I'm watching it anyways.

Should the polynomial we are dividing be irreducible or primitive?

Great video. Thanks

0:44 3000 = 15(197) + 45 3000 div 197 = 15 3000 mod 197 = 3000 - (197 *15) = 45 2:05 Left side of video 6 = 1(5) + 1 (solve for 1) 6 -1(5) = 1 1 = 6 - 1(5) (just switched sides, now it looks like the top right) Now get rid of the 5 from this equation So we work with the 2nd last equation on the left side 11 = 1(6) + 5 5 = 11 - 1(6) Now plug into [5 = 11 - 1(6)] into [1 = 6 - 1(5)] 1 = 6 - 1(5) 1 = 6 - 1(-1(6) +11) 1 = 6 +6 - 11 1 = 2(6) - 11 Repeat the process one more time Use the 3rd last equation on the left side and isolate 6 17 = 1(11) + 6 17 - 1(11) = 6 6 = 17 - 1(11) [re-expressed the equation] Plug [6 = 17 - 1(11) ] into the 2nd equation on the right side [1 = 2(6) - 11 ] 1 = 2(6) - 11 1 = 2(17 -1(11)) - 11 1 = 2(17) -2(11) - 11 let a = 11 1 = 2(17) -2a - a 1 = 2(17) -3a 1 = 2(17) - 3(11) Hopefully, that helps, that was too much mental arithmetic going on for me 🤣😭

Much help thanks a lot.

Thanks a bunch❤

FERMAT n'a jamais utilisé tous ces calculs inconnus de son temps ! La solution est bien plus facile. Trouvez d'abord l'équation générale UNIVERSELLE cachée de FERMAT, valable quelle que soit la valeur de Zpuissance(N) et ENSUITE, vous en déduisez que Zpuissance(N) =Xpuissance(N) + Ypuissance(N) n'a pas de solution ! (conjecture de FERMAT).J'ajoute que c'est le plus beau CANULAR mathématique de tous les temps et c'est un mystère de voir autant de mathématiciens tomber dans le piège en formulant des théories inconnues de FERMAT .Il y en a même qui pensent que FERMAT n'a jamais eu la démonstration ! La démonstration est si courte et si facile que vous ne trouverez pas, cherchant une solution compliquée. Ce n'est pourtant pas difficile à comprendre ! Pour ceux que ça intéresse , afin de ne pas me répéter encore une fois, aller sur d'autres sites de FERMAT pour avoir plus d'explications de ma part..

The explanation for question one does not make sense to someone who knows nothing about this subject, the syntax and operations performed are inexplicable: Because Randell says 5 mod 3 = 2 mod 3 Without any explanation of why that is or how such a stupid looking syntax came about. Therefore not worth even trying to look at the other questions he aims to explain

Just amazing! Thanks to you i saved a lot of time

Great examples!

very useful, ty

That was super-easy to follow! Thank you.

is 5^34 divided by 17 have a remainder of 1? Cause the textbook I have has a different answer.

merci bcp j taime fort

Triangle form is modular form. Proof of x^n+y^n=z^n < triangle ratio.

Hi this is an amazing video thank you! Just wanted to clarify if a_0 is meant to be divided by 2 in the original formula at the beginning? I’ve seen it like that on a lot of other formulas online, I could be wrong though!

I hate my lecturer who never makes things clear and also doesn't point out where to study, he'd better leave the academy since he's that incompetent to teach the student. Everyone suffers other than those who already got a mathematics background, everyone.

Sorry but this explanation is very difficult to understand, no idea what is even going on

x^n+y^n=z^n is natural number combination three take in set theory are the three theory did a graph undercover