The Math Needed for Computer Science (Part 2) | Number Theory and Cryptography 

Hey guys, since this I made a more updated video on number theory and how it's used in cryptography. Mathematics of Cryptography: ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-uNzaMrcuTM0.html

this dude explain GCF better than all the math teachers i've ever had in a really simple and mind friendly way

I would love if you did a series on math in computer science, you explain things very well even if they may take longer or bigger jumps. I can write code pretty well, but math can always stop me in my tracks when just written in large or long formulas or with special symbols. When you explain these problems it's more of the logic behind them which I could easily write in code.

CS is looking more and more up my alley. Thanks for these videos sir, you're a blessing.

Thank you, this made me fully decide to pursue a degree in physics.

Dude, look what you have done ! You scared them away

I wish I had known this in high school. I was so intimidated that I didn't even find out that the math was actually right up my alley.

I just started a PhD program this semester, and my eyes glazed over when we started talking about this (IS background, CE program). You've done a great job explaining it. Thanks for making these videos.

I understood gcf for the first time after learning it in 9th grade almost 25 years later. Great stuff mate. Cheers.

Your explanation is one of the best! Thank you for bringing back the joy of mathematics to me who is not a mathematics major in university!

The way you broke down those concepts really made me feel like im overcomplicating everything. It's so simple when YOU do it.

Man I love and enjoy your videos so much, you make it sound so cool and interesting.

In just 2 vids men youve earned a sub thanks a lot

You're amazing, man! Don't stop doing these videos, I love them ! :D

I love this. Make a new series where you go more in-depth. You're very good at explaining these topics. I'm sure it'll be a hit.

I watched Part 1 and 2... +1 subscriber, these explanations are super helpful! Keep up the good work!

Great simple explanations with great examples

I remember my high-school taking me to a class at my local college where they talked about Cryptography and they went over the same things you did here. I wish I could have gone to college to learn this but I guess your video will do.

Awesome videos man, love your content.

This videos are making me crave more math videos from you...😁 Thanks for making them... I hope u'd do some elaborate work on math for Comp sci... 🤗

Great definition of computer science given by a professor that "computer science is an art of abstraction" . It is clearly demonstrated in your both videos. Thankyou

This is a good video. Has a bare-bones description of the relation between number theory and cryptography.

Wow that was so cool.! I want more videos like this. Thank you

This series has been really valuable to me thanks

You are doing an amazing work man.thanks a lot💕

Thank you for these videos!

Number theory is the thing that has most impinged on my computer science career. Implementing error correction, cryptography and a host of related things call for Galois fields. When you have that hammer, all nails start to look like extensions of GF(2).

I love these videos Keep it up

Great video, thank you so much.

This is very helpful for my discrete math final, thanks :)

REALLY GREAT CONTENT! Thanks a lot.

Thanks OG Zach

Great stuff. Thanks!

Thanks alot, it was really exciting

I like these videos, keep them up.

I have never understood cryptography this vividly!

Wow i wish all math was made this fun. Keep up the good videos! As Charlie Day says, I'm learning a lot!!

man you're the man

Great video

this year i am joining cs and man i think i will love it after this video

Well done!

Wow I really wish this video was out when I was in high school.

very informative...thanks!

that last example blew my mind, prime numbers OP

Thank you!

great simple stuff...shukran

7:09 . DARN SMART!

I love and Enjoy You're Videos sir , With Accuracy & Clarity Really Amazing .

I have never love hated something so much.

Thank you.

Also note that according to the distribution property 24n+40m = 8(3n+5m)

Love u bro u inspired me to take cs

Zach..ur superb..

That math actually looks fun

Very interesting 👌

that's pretty cool

OK, this is epic 😎

..just some advice or personal preference which may be common, the white background with black text is much harder in the eye than black background with a lighter coloured font, the blue wavelengths in White led produced light is a health hazard so less White is better in general, 3blue1brown's videos are very easy on the eye as they generally have dark backgrounds, just an idea to incorporate if you're open to suggestions, thanks for your interesting topics

The ruler puzzle is like the Die Hard water puzzle:-)

To the people thinking “this math is up my alley”, you guys are in for a surprise. Calculus 1,2,3 and differential is actually less harder than discrete math. Just an FYI

Thanksss

Can you do a video on use if numbers in CAD files? This causes vexing problems, such as calculate a path that is "X" distance from a set of other elements (lines and arcs) on the workspace. This is used to calculate toolpaths (given a cutter radius) to outline a shape formed from lines and arcs. The difficulty is no matter how the precision of the math, computer numbers lack the "property of density" decisions such as whether 2 lines are connected, or whether their intersection point is distinct of identical to one endpoint. How does one write such an algorithm? (I can tell you that expensive software "screws up" this, sometimes generating toolpaths that cut up the piece, others that generate "digital debris" that bogs down the machine!) There has to be a better way! (Comment about software: unlike other engineering, where one can "reverse engineer" a design, it is not practical to do so in software. How does one learn from others?)

great theme and both parts! used the opportunity to try to grasp any potential relation between that and finite element method, as well as generative design. anybody?

congratulations on Getting 1 million sub 😁😚

3:23 Yes, with 6 pcs of 7cm ruler and 9 pcs of 5cm ruler. To think that there's a simpler answer, yet I got this.

The hardest class for most cs majors is the cs math class that goes through this and much more.

Very cool, Mathematics rule science, including computer science.

You earned a SUB, Congratulations!

Thats why from python begginer exercisies computing prime numbers?... In my mind what the hell do i need prime numbers for?? Now i understand and im very intrested.. Thanks for your help...

A genius and a comedian 😎

Thanks

(This question is out of the Box and most likely wrong) The GCF regarding Cryptography: For Example in Wireless hacking if i got 2 handshakes from different client addresses (users) on the same access point (wifi) would I be able to decrypt the password? Considering the Hashing as well.

What about linear algebra? It's like the core of CS

Hello I recently started watching your videos and they are amazing... I have a question that I want to do graduation in a course related to software designing(AI, vr,ar specifically) game designing so should I do Cs or software engineering or any other course??

Pls make a video for chemical engineers😁.

now make a part 3 video with the 90% that was too advanced.

To that ruler problem: isn't it enough of proof that we can measure 3 cm and 2 cm and have unlimited rulers, and can like that measure 1 cm and repeat that 1 cm infinitely?

6:56 Encrypted Message divided by Secret Key is the "Hello" appended 79 at the end (the another prime), but how to recover plain text (HELLO)?

How can we prove that the smallest positive integer is always the GCF? 2:25

“Number theory is just the study of integers” man, i wish…

Compared to highschool math is it easier to understand the logic or how something works?

Nice

Could you suggest books or any course to learn number theory?

2:42 Small?? Seems average to me It might have a great personality 🙂

There is an error in your proof with the rulers -- or actually with your statement of the problem: If you lay about four 5 cm ruler on one line and two 7 cm rulers on the other you get a gap of 6 cm; if you then add a 5 cm ruler to line two you get 1 cm. The error appears to be that you had extra rule (that only rulers of the same length can be in a given row), but did not state that assumption. Thus you produced a valid proof of a different set of conditions, but not of the conditions initially stated.

Well I'm really passionate in solving problems of maths Is cryptography right for me as a career option

Now this is what I'm talking about....typa sh*t I like

Alright it possibly to factorise a number if it is an integer. What about a complex number whose real component and imaging component are integers? Is it possible to factorise it? And if it is, are these factors prime numbers? In other words, do prime complex numbers exist?

How do you start learning number theory? I have studied Electrical Engineering, which is probably less math intensive than a CS degree. I find myself liking to code nowadays, so I think learning mathematics would help me train my brain better. Any help for dummies would be appreciated.

“Lets say we have an infinite amount of rulers”

I think we know of a much better algorithm that a perfect quantum computer could do, although we have no perfect quantum computers.

Modular function mod period.

спасибо видео было очень полезным вы мне очень помогли :ru:

1:20 I know how to do this one, the ol proof by calculator

16 calendars of poetry

I wasn't really paying attention to how small the rulers are but, okay

Advent of coders will thank you

WHY DO I UNDERSTAND ALL OF THIS!!!???!! THE ALPHA SETH IS COMMUNICATING WITH ME!!!

zach the star himself?

So if i do not really get this, should I not go into computer science?