[Tagalog] Problem solving permutation

[@Yuzuplays]

Thank you sir! Makabawi nako sa solving sa discrete math

[@nativeman]

Thanks and good luck anak..

[@terrenceseverino493]

Sa wakas mas madali na mag solve salamat great teaching video.👍🗿

[@nativeman]

You're welcome anak.. ❤️❤️❤️
Please subscribe and share to your classmates... salamat in advance anak

[@terrenceseverino493]

@@nativeman anak sure ka sir.🤣

[@nativeman]

@@terrenceseverino493 hehehe anak ang tawag ko sa mga students ko kaya anak na rin nakasanayan mo dito yt

[@terrenceseverino493]

@@nativeman 🤣

[@boxingroove]

Happy Sunday Sir Math sagutin ko na, a) Couples must stay together n lang 🥰

[@nativeman]

Salamat manen kabsat.. apay ngay binuram met dagijay boxing nga upload mo.. sapay adu views nan..

[@boxingroove]

@@nativeman 😆 kasanu ket binawi na Mut😆 Sir

[@KapeBoyUpdates]

Wow... thank u for sharing again sir.....

[@nativeman]

Thanks very much po sir

[@AnjuKThomas]

Made useful thank you

[@nativeman]

Thanks very much my friend..

[@Treegarden509]

Great sharing 👌

[@nativeman]

Thanks my friend

[@zrusszruss2133]

meron na poba sa special conditions?

[@ireenmkandawire5844]

❤❤

[@nativeman]

Thanks for the ❤️❤️❤️

[@xristutorials]

Pinapanuod din ng eldest ko ilan sa mga tutorials mo

[@nativeman]

Wow thanks sa support friend

[@kingronaldguanez8183]

3840 po ang sagot sa problem no. 1 thank me later! 🥰

[@larz_0gXV]

explain pls

[@kingronaldguanez8183]

@@larz_0gXV just watch some tutorial! I'm not your teacher 🙄

[@ywlan]

​@@larz_0gXV It's because there are two complexity classes, polynomial complete (P) and non-polynomial complete (NP), that are used to categorize math problems. P problems are able to quickly be solved by computers and NP problems aren't. Modern information security is based on using NP problems because it takes absurd amounts of time (as in years) for computers to solve them if they don't have the key. The problem is that there's no way to prove that an NP problem is *actually* impossible for a computer to solve quickly. It could just be a case of looking at the problem differently and writing a new algorithm, but there's no way to know if it is or not. For example, there's already an algorithm called Shor's Algorithm that can break encryption based on factoring and discrete logarithms, which are NP problems, but only when run on a quantum computer (none of which currently exist). If it were possible to prove that P=NP, or in other words that all problems can be quickly completed, it would mean modern encryption is not secure. This would mean we would need to turn to other methods of securing our data, such as Quantum Key Distribution methods.

[@larz_0gXV]

@@kingronaldguanez8183 no, explain it

[@emilyballesteros6400]

@@larz_0gXV me na lang mag explain why 3840 because there are 5 couples 5!=120 times the arrangement of each couple is 2! .2!.2!.2!.2! = 32 THEREFORE 120X 32 =3840 THANK ME LATER ALSO

[@sierra8422]

Ako NI mabini ha

[@nativeman]

Thanks

[@ferdinandasuncion9607]

I guess you've mistaken your Problem 1-a, it should be 5!(2!2!2!2!2!)=120 x 32=3,840 ways. You can check it by listing using 3 couples.

[@hanakokun404]

How did it become 32?

[@nativeman]

Thanks.. let me try

[@ronald.dagdag]

2!2!2!2!2! when you calculate it the answer is 32 so 120×32