Permutations Involving Repeated Symbols - Example 2

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

Is it weird that even if I already understand it like really really well (thanks to you), I still watch it like a bagillion times cause it's so awesome? You're amazing, btw, Patrick. I don't know where I'd be in Math now with out you. :D

patkaybites
Автор

Really awesome exemple, made me go 'ahhhh'. Thank you so much for giving me one of those moments!

petris
Автор

Great! I wish you were my teacher for this course...

amjad-se
Автор

What if we were to compute all the permutations in the xyz coordinates? Whether it is in the 1st quadrant, 2nd, 3rd, or 4th, or negative quadrants, the permutations would be infinitesimal, therefore it would be impossible to, because as each increment approaches the next, the limit approaches infinity, evoking the question, “How big is big?” Or “How small is small?” They are exactly relative, giving life to each other’s function.

Syruscleat
Автор

Suppose there is an n X n grid where n is odd. How many different ways are there to go from one corner to the other if you can only go to adjacent squares, AND you must conver every square along the way? n must be odd because if it is even there is no way to do it. Personal-message me if it's too long, or make a video response. I think it's 2^((n-1)/2) but I'm not sure.

anticorncob
Автор

@heybrian6 then use the letter D and same procedures.


TheLunatic
Автор

Couldn't one use a path that goes down and then up?

rohancardoza
Автор

5 comma 3
This is like entourage when they cut in the middle of a sente-

imgoddlike
Автор

it is not about math. it is only about computing. does not tell any reason

huichen