Reminds me of a joke. Teacher shows a big jar full of beans, and asks the pupils: how many beans are in the jar? One pupil raises his hand and answers: 372. Teacher is astonished and asks: how do you know that so fast? Pupil says: prove me wrong.
..well thats an interesting problem actually... we know thers 243784 ways to get there...if we assume one block for the moment to be 1m*1m thers at a minimum 243784 meters, but thers a problem...look for example at the 1's at the edges...1,1,1,1 path but 1,2,3,4 meters to each path, the trick is to use a modified pascals triangle to find the solution instead of starting 1,1,1,1 it starts 1,2,3,4...and so on and whwn u come to a hole, instead of copying the value u add one for each block, and uses that value instead of the pascal triangle value its 25 blocks right and 14 down so 1 to 25 and 1 to 14 distance to walk [243 784 meters < walker < ( (25+14) * 243784 = 9 507 576 meters) ] a human walks on avrage 1.4m/s so between (a standard value used in city planing and so on...) 174 131s(48h 22m 11s) to 6 791 109s (78d 14h 25m 9s) ... so after 78d u seen all of the city.. (correction: u walked all possible paths) if its configured as in the video and one square is 1*1m
@@Patrik6920 You could solve it by storing the path length at each point. All the paths to a given point will take the same length. So just multiply the number of paths by the path length at each point.
@@gabrielfonseca1642 ..hum..elabourate...i supos u mean closest path?...not ALL possible paths (wich is enourmously greater)... als a limitation of the problem in the video (closest path constrain: u can only walk righ/down and never back a path (wich would go to infinity) ... what u describe is a nearest path agorithm if i understan u right...one that jst takes path length(distance) into account... edit: for example a simple 2 by 2 square, it is 6 possibly ways going from any point to another, and 4 possibly shortest paths that has more than 1 solution, and only 4 paths(solurtions) that has only one shortest path solution.
I actually took out paper and pencil before watching the video so don't get spoiled the answer. Over half an hour later I realise I got one sum wrong near the start and got 242002 bruhhhhh
Your a mathematician you shouldln't be involved in such problems or not most of the time at least focus about the main structure of math which is analysis and set theory and geometry best of luck those are to some extent are only mere puzzles.
Reminds me of a joke. Teacher shows a big jar full of beans, and asks the pupils: how many beans are in the jar? One pupil raises his hand and answers: 372. Teacher is astonished and asks: how do you know that so fast? Pupil says: prove me wrong.
Holy you're making me love maths. This channel's gonna blow up, I'm saying it now!!
It's already blowing up hard I imagine at least 20k by the end of the month at min
@@erazemburger1153 ur month is quite long
sadly he hasnt uploaded in 8 months and his description is currently "goodbye cruel world" or smth like that
You're good at this man. Love your style, incredibly relatable.
Dynamic Programming! Wow!
As soon as he mentioned "we just have to think about the last point" it hit me. It's ironic he mentioned not knowing how to code
Awesome videos! If you keep them kid friendly, I can share them with my students, too!
bro why do you only have 1k subs?!
Edit: 5.9k subs in 5 days. You’re popping off!
Exactly
They have 3560 subs but still this video feels like it has so much quality.
No worry he popping off now and has 3.8k
4.82!!
5.47 jeez how did he get so much in a single day
I love those videos, like literally im just eating them up. Youre explaing in a really entertaining way
Yeah, that does seem like the kind of problem that at some point would be a lot easier to be handled by a script.
Imagine a city block with these streets and you want to take all possible ways to the other side
it would take at least an hour, maybe even two
..well thats an interesting problem actually...
we know thers 243784 ways to get there...if we assume one block for the moment to be 1m*1m
thers at a minimum 243784 meters, but thers a problem...look for example at the 1's at the edges...1,1,1,1 path but 1,2,3,4 meters to each path, the trick is to use a modified pascals triangle to find the solution
instead of starting 1,1,1,1 it starts 1,2,3,4...and so on
and whwn u come to a hole, instead of copying the value u add one for each block, and uses that value instead of the pascal triangle value
its 25 blocks right and 14 down so 1 to 25 and 1 to 14
distance to walk
[243 784 meters < walker < ( (25+14) * 243784 = 9 507 576 meters) ]
a human walks on avrage 1.4m/s so between
(a standard value used in city planing and so on...)
174 131s(48h 22m 11s) to 6 791 109s (78d 14h 25m 9s) ...
so after 78d u seen all of the city.. (correction: u walked all possible paths)
if its configured as in the video and one square is 1*1m
@@Patrik6920 You could solve it by storing the path length at each point. All the paths to a given point will take the same length. So just multiply the number of paths by the path length at each point.
@@gabrielfonseca1642 ..hum..elabourate...i supos u mean closest path?...not ALL possible paths (wich is enourmously greater)... als a limitation of the problem in the video (closest path constrain: u can only walk righ/down and never back a path (wich would go to infinity) ... what u describe is a nearest path agorithm if i understan u right...one that jst takes path length(distance) into account...
edit: for example a simple 2 by 2 square, it is 6 possibly ways going from any point to another, and 4 possibly shortest paths that has more than 1 solution, and only 4 paths(solurtions) that has only one shortest path solution.
for anyone intrested about this, this is a classic dp (dynamic programing) problem
Great video
I actually took out paper and pencil before watching the video so don't get spoiled the answer. Over half an hour later I realise I got one sum wrong near the start and got 242002 bruhhhhh
Great video!
243784 PATHS! WOW!
That's insane! Not the puzzle, but the fact that you said you had to sum up everything lmao
Wow this video is very good
Is the 4 by 4 pascal's triangle
2:33 WAIT I THOUGHT YOU WERE GOING TO PREDECESSOR ALL THE WAY BACK BUT I JUST REALZIED YOU CAJ USE THIS YO REDUCE TK SMALLER BLOCKES AAA
The upper and left lines are all just 1
Pascal triangle square be likw
5:28 a
Really nice video, thx !!
I learnt this at my school's mathcounts club.
Brilliant ! +1 sub !
this reminds me a little bit of integral images.
interesting
Your a mathematician you shouldln't be involved in such problems or not most of the time at least focus about the main structure of math which is analysis and set theory and geometry best of luck those are to some extent are only mere puzzles.
pascals triangle :0
Just use your sound I cant watch with this sound please dont male your noise like that If you dont want to talk I can talk for you
weird ass comment lol
@@Martykun36 his sound and you are weird
243784