soon as he drew the star i thought pascals triangle :D didnt pause it to find out how many ways there were, just skipped to end and saw it was pascals three cornered friend
Thank you so much for such a well spoken and demonstrated explanation of this concept. This has helped me no end. Who would have thought youtube could be used for something other then videos of cute cats and charlie biting his brothers finger. Thank you again, i will check out your other vids
@nhojmabon darn you! I was just going to write a comment saying that exactly. But I guess I´m 1 year late, hahaha! Nice to see someone else thought about it the same way though.
This was a pretty cool problem, I got it with solving small squares and looking for a pattern. I got it in the form of a sum as well, so you get c(n-2+k,k) from k=0 to n-2, where n is the dimensions. Never seen it before. Was cool to see how it worked once I realised it was using the binomial theorem.
lol at first I thought there were 12 ways. Now after the video I know i couldn't be more wrong. To see the connection to the binomial coefficients amazed me!
Instead of going from cell to cell, if you go from vertex to vertex (following the line segments) I came up with 924 paths. Technique is the same. These problems are great. Thanks!
You have to go down 5 times and right 5 times, for a total of 10 moves. We can put 5 "down-moves" in those 10 moves C(10,5) ways, and count the rest as right-moves.
Notice this works in rectangular formations as well, regardless of whether you pick downmoves or rightmoves to work with as C(n, n-r) always equals C(n, r).
Wow, I did not notice the connection with binomial coefficients at first, but it will be a very useful concept to have. Even though the grid problem was easy, I am glad you uploaded the video.
do you know path algebra and its representation?? if yes, then put some video please!!
ilkhamharzmiy 1 month ago in playlist Mathematics
what program are you using?
midnight4fox 1 month ago
Come teach at my highschool? (:
Garrett666999 3 months ago
just go six any side then go to the last mark peroid~!!!!
radius34 5 months ago
This one I liked! Cool! I've got it right a way!
NewScienceAu 6 months ago
This is the easiest one o far! Had fun, anyway!
ProGroupRacingAU 6 months ago
I saw this on Arts of problem solving so I already knew that I had to use combinatorics.
valdas0 10 months ago
10! / (5!*5!) easy :)
efrestein 1 year ago
i saw 11 ways
AllisonMY 1 year ago
minesweeper.
gfaithw 1 year ago
id like you as a math teacher this is actually fun o.o;
4NG3LxD3M0N 1 year ago
This has been flagged as spam show
Some faster ways to count:
(6x2)x((1+6)x6)/2
or
(6x2)x(1+2+3+4+5+6)
or
(6x6)x(1+6)
xxSwAmPxx 1 year ago
Comment removed
xxSwAmPxx 1 year ago
Comment removed
xxSwAmPxx 1 year ago
Comment removed
xxSwAmPxx 1 year ago
@LemonyDragon yeah, i recognized how to solve it by pascal's triangle at 0:47
francis0000b 1 year ago
soon as he drew the star i thought pascals triangle :D didnt pause it to find out how many ways there were, just skipped to end and saw it was pascals three cornered friend
denni0302 1 year ago
Pascal's triangle. MIND = BLOWN.
UltraMaXAtAXX 1 year ago
10C5
kinovers4 1 year ago
Thank you so much for such a well spoken and demonstrated explanation of this concept. This has helped me no end. Who would have thought youtube could be used for something other then videos of cute cats and charlie biting his brothers finger. Thank you again, i will check out your other vids
povrick 1 year ago
this is basically dynamic programming.
hctivas 1 year ago
COOOL
TheGozzila 1 year ago
Holy schamoly it looks like pascal's triangle!
Pyrobladestudiosx1 2 years ago
huh? i dont even know what the quistion is!
SkInNyT3 2 years ago
Comment removed
azfanification 2 years ago
This is beautiful!
DartmouthAlum96 2 years ago
HEAPS OF combinations is all i say
rhysy07 2 years ago
Here's how I solved it:
You will need to make 5 steps down and 5 steps to the right.
R - Right, D - Down
One combination is 'RRRRRDDDDD', another is 'DRRRRRDDDD'. Finding all combinations of this 10 lettered word is a standard high school math problem.
Possible combinations = (Total letters factorial)/(5D's factorial x 5R's factorial) = 10(fac)/(5fac x 5fac) = 10x9x8x7x6x5x4x3x2x1/(5x4x3x2x1 x 5x4x3x2x1) = 252 combinations.
nhojmabon 2 years ago 28
Wow, that's a cool solution!
I haven't even thought about using combinatorics at this problem...
Michel290389 2 years ago
@nhojmabon darn you! I was just going to write a comment saying that exactly. But I guess I´m 1 year late, hahaha! Nice to see someone else thought about it the same way though.
ocram3333 1 year ago
@ocram3333 hehehe sorry about that, better luck next time.
nhojmabon 1 year ago
@nhojmabon nice method
mine was stupider
he has to walk 10 steps he has to select any 5 to the right and the rest automatically become upward
so the answer is 10c5 or 10 choose 5 =10!/5!.5!
dheeraj54 9 months ago
@dheeraj54 Nice method, definitely not stupider.
nhojmabon 9 months ago
@nhojmabon thanks
dheeraj54 9 months ago
This was a pretty cool problem, I got it with solving small squares and looking for a pattern. I got it in the form of a sum as well, so you get c(n-2+k,k) from k=0 to n-2, where n is the dimensions. Never seen it before. Was cool to see how it worked once I realised it was using the binomial theorem.
Raysyns 2 years ago
oh and the sum is times 2 which I forgot to put
Raysyns 2 years ago
lol at first I thought there were 12 ways. Now after the video I know i couldn't be more wrong. To see the connection to the binomial coefficients amazed me!
Thank you Sal for making these videos!!!!
02280228 2 years ago 7
36 ways
y2knoproblem 2 years ago
Instead of going from cell to cell, if you go from vertex to vertex (following the line segments) I came up with 924 paths. Technique is the same. These problems are great. Thanks!
konopong 2 years ago
Pascals triangle :)
veers0r 2 years ago
You have to go down 5 times and right 5 times, for a total of 10 moves. We can put 5 "down-moves" in those 10 moves C(10,5) ways, and count the rest as right-moves.
Notice this works in rectangular formations as well, regardless of whether you pick downmoves or rightmoves to work with as C(n, n-r) always equals C(n, r).
MrMss4 2 years ago
Comment removed
MrMss4 2 years ago
That was fun to watch and inspiring.
Also very good explaining and didactic built up.
have a nice day
silk
blacksilkblacksilk 2 years ago
Wow, I did not notice the connection with binomial coefficients at first, but it will be a very useful concept to have. Even though the grid problem was easy, I am glad you uploaded the video.
Lexiathan 2 years ago
10! / (5! x 5!)
cconrad246 2 years ago
Pythagorean ?
doctish 2 years ago
Pascal
undeadxazn 2 years ago