วีดีโอ

Thank you, that was so useful, I would like to know how it was animated, I'm planning a class in which that kind of presentation would be perfect

well done!

😊

Wow this is exactly what i was looking for ! Thanks ! ❤ I had to page through so many yt searches before finally finding this video. It was a pain. Too many people surfing on the einstein tiling and too many people making 20min videos that just say the most basic info about tesselation (and they actually often say wrong stuff also because they're not rigorous).

helllllllloo

hi ingi

thank you for the help

Thank you for the help

Im here cause of math class

That was very helpful, Thanks!

Cute video

How to do the hexagon?

Great explanation, thank you!!

U are bestttttt, so helpfullll. This must have taken sooo much efforts

Please make more!!!!

I wanna be able to show that for a given x in W_q and y in V_q then d(x,y)>0 this would show disjointness of W_q and V_q right?

A simple improvement is moving forward after going 2n places until you reach a car in the same state as the first car before doubling back. Therefore growing n a little quicker.

I wonder if by setting the cars you've gone through to a specific pattern you might be able to grow n quicker. I suspect turning on powers of 2 only may have utility. Or only turning on one.

Good explanation..

Super easy. Since there is no mention the cars are moving, we can assume they are fixed in space. Using a compass, note your starting point relative to the compass. Proceed through the cars counting until you have reached your original point on the compass. Done.

Since one of the assumptions is a circular train, can you take advantage of the fact that the minumum train length is 3? A one car train cannot have its right exit adjacent to its left entrance. Also, a two car train would not be able to connect its exits and entrances. A three car train would be more like an equilateral triangle, but it would approximate a circular train.

Thank you so much! Both of your Rudin videos were very helpful :) you should continue with these!

Efficient? Turning all these lights on is going to really increase energy consumption! :D

Such a good video, thanks man!

What kind of tesselation is this? A reflection, translation or rotation? Thank you.

Awesome Video! 👍🏻👍🏻👍🏻👍🏻

I absolutely loved this video. Inspirational. Thank you.

It is simpler to say that the list of primes is endless because the lowest factor greater than 1 of p!+1 must be a prime number and must be greater than p. This is not actually a 'proof by contradiction'.

Kei bujena♥️

This is amazing

Not sure if this is more efficient, but i think there's a number of ways to go about solving this puzzle by using alternating on/offs to count. For example, the most primitive one would be to just walk the length of the train and turn everything on, then alternately switch off the lights and count the number of switches you've pressed, and once you reach a car-oh just realized if the train has an even number of cars you're sorta stuck and also how do you even know when to stop doing the switch everything on in the first place? LMAO there goes the whole thing welp, fun puzzle tho

merveilleuse

Bravo! This is the first video I saw on TH-cam that actually demonstrates how Escher played with geometry, rather than some random translation/rotation/reflection.

"They'll snuggle together...like Teddy Squares"... Anyway, thanks for the demo (four years ago).

This is the best explanation of this proof I have ever seen. Thank you so much!

nice video

Very good!

WOW great !

Hello. great video. What program are you using to make the shapes e.g. pegasus from the square? I'd like my students to make a tessalation but on the computer. not with paper

Broooo I finally found the perfect video after an hour of searching

Thanks for the explanation keep up the good work

🙏Thank you, this was very helpful to understand the principle.

You can do slightly better than saying prime pairs sandwich a multiple of six. The table in the video is a simple expression of the idea of wheel factorization (there's a Wikipedia page, just like for sexy primes!). The next larger table would have thirty columns, and an examination of those columns would eliminate one of every five multiples of six as a candidate, because one of the columns would have no possible primes past some lower bound. After that, you could build a table with 210 columns and eliminate another class of multiples of six as sandwiched values, etc. An observation about this idea, though, is that it really doesn't really narrow down prime pairs so much as it just narrows down primes. As should be obvious from the six table, it's not actually prime pairs that are excluded--it's primes that are excluded and the exclusion of prime pairs just sort of comes along for the ride.

This is very interesting! I hope you don't mind my adding your video to my custom M.C. Escher playlist! th-cam.com/play/PLjoG5aXflB9woFTm0Q_yFCZICCejQb_3u.html

bro , it is the best algebra tutorial ever

what if i just count the light switches? would that count?

God level 😀😀😀😀😀

Amazing explanation...need more buddy💯💯

So these are regular tessellation right??

Wow, what a beautiful and simple way to prove this! Thank you! Both your channel and this video are underrated