Відео

Thanks you so much it was clear and the essential!

Thank you so much!

It was difficult to see the paper

Why do you assume the bicconditional with P? If you try with Q, you will find another true. Which is the correct one?

Yeah, I’m having trouble with my conclusions following logically from the premises.

Thank you bro

ahhhh thank youuuu. I couldnt wrap my mind around these problems and with this method you dont even need to understand what theyre saying.

Thank you!

Why do you have the and at the end why is it not an or

watching before my discrete maths exam yay

face reveal?

Best in class! Thanks a lot man!

Thanks sir this is first one which i was easily able to understand in english

In the proof it's not sufficient to check the recurrence, you also need to check the base case (which you already did in the previous step but it also has to be a part of the proof).

What if we wanted that x1 <= x2 <= x3 <=..... Xn ?

This was an AMAZING explanation, thank youu

Fantastic video

Thank you so much!

This helped so much!!!

thank you!!!!!!

good explanation

Thanks!

Thanks. Very clear explanation.

My man.

This is strong induction. Weak induction only claims likelihood and never of absolute certainty.

My man.

Helpful

Can Someone explain to me why you use the biconditional and compare P to what A says

Thank you man. You are better than my professor

Thanks:)

Thank you!!!!

bruh

Thank you very much. Really help my Discrete Mathematics homework.

You meet a group of six natives, U, V, W, X, Y, and Z, who speak to you as follows: U says: None of us is a knight. V says: At least three of us are knights. W says: At most three of us are knights. X says: Exactly five of us are knights. Y says: Exactly two of us are knights. Z says: Exactly one of us is a knight. Which are knights and which are knaves? can this be solved using this method?

Thanks :)

Thank you! I'm not even in this class nor do I go to this university but this was very helpful!

thanks my g!!!!!

Awesome! Thanks a lot

this is strong induction, not weak!

This is very helpful. Another video that very well explained the stars and bars: ua-cam.com/video/qko8XWkAE_I/v-deo.html

Great tutorial but in Example 2, wouldn't n = 12? (0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, and 11)

Neat explanation, helped me to understand strong induction

Beautiful explanation

Yea, someone else already mentioned it but indeed, 1 is not a prime number hence why this problem typically starts at n >= 2. It was explained to me that if you took 1 to be prime, then you break the universe (at least the universe in which the fundamental theorem of arithmetic exist).

One thing I want to correct is:1 is not prime number.

awesome and straight to the point

thanks bro you saved my grade

This was very helpful, thanks!

thank you for putting this content out there

Thank u