Prove the Function is Onto: f(m, n) = m + n

preview_player
Показать описание
If you enjoyed this video please consider liking, sharing, and subscribing.

You can also help support my channel by becoming a member

Thank you:)
Рекомендации по теме
Комментарии
Автор

like the 2 and the -b, do you simply chose that at random, dawg this shi mad confusing

adamfuzesi
Автор

Seems more straightforward to let n = 0 and m = b. Your videos are a nice refresher for my maths course thanks for making them : )

liamgallagher
Автор

scratch work was awesome. Learnt a day before quiz. Thanks

ibtishamtashin
Автор

I'm from the future. Thank you for this video. I'm taking discrete math and this helps a lot even though the examples are not the same

davidnguyen
Автор

thanks a ton 😂, well explained.. pls upload more n more great videos..

naageshk
Автор

what happens if you replace ZxZ->Z to RxR->R Im curious to know

furiezy
Автор

So you are saying that 90% of all math is written into the dustbin?

mendelovitch
Автор

do you think there's an IQ requirement for getting a math degree? Obviously excluding the extreme low range, what I'm asking is if you think a person of average or slightly below average intelligence can learn to grasp high level math.

agh
Автор

Hello sir,
I need your help kindly see the problem given below

Q. Let Z denote the set of integer and Z>=0 (0, 1, 2, 3, ...). Consider map f:( Z>=0)×Z to Z given by
f(m, n)= (2^m)(2n+1) then we have to check the function is one to one and onto ..?
Thanks

akashgargate