Ben Tupper

Пікірлер

@MrBobain 5 ай бұрын

Im here cause of math class

@CureXTheRapper 5 ай бұрын

@MrBobain 5 ай бұрын

Yes

@CureXTheRapper 5 ай бұрын

I am here cause of math not u

@themasterofherself1109 6 ай бұрын

That was very helpful, Thanks!

@Zuivui8570 7 ай бұрын

Cute video

@nynkestutorials3182 8 ай бұрын

How to do the hexagon?

@Superpellexl 8 ай бұрын

Great explanation, thank you!!

@suhanisoni3208 8 ай бұрын

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

@shreyanpurwar1085 9 ай бұрын

Please make more!!!!

@fanalysis6734 10 ай бұрын

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?

@tsepten7930 3 ай бұрын

correct, u can use triangle inequality

@Jeremy-The-Bullfrog Жыл бұрын

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.

@Jeremy-The-Bullfrog Жыл бұрын

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.

@Jeremy-The-Bullfrog Жыл бұрын

I think doing something like this should allow you to double n moving forward instead of backtracking whenever the end of the line doesn't match the start of the pattern. So for example if you turn all lights on, only need to turn back when the last car is on. (in this case moving you may want be required to turn everything on moving clockwise everything off moving counterclockwise)

@anisurrahman5498 Жыл бұрын

Good explanation..

@9999blackops Жыл бұрын

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.

@JDAddelston Жыл бұрын

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.

@LaurenWehausen Жыл бұрын

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

@TomDeGreyt Жыл бұрын

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

@NehmuloseDoomish Жыл бұрын

Such a good video, thanks man!

@melaalising2787 Жыл бұрын

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

@anay_sharma Жыл бұрын

Awesome Video! 👍🏻👍🏻👍🏻👍🏻

@haydeeze Жыл бұрын

I absolutely loved this video. Inspirational. Thank you.

@apusapus71 Жыл бұрын

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'.

@priyamanger8590 Жыл бұрын

Kei bujena♥️

@nshaff3r Жыл бұрын

This is amazing

@ManekaAgarwal Жыл бұрын

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

@yifuzhang8058 Жыл бұрын

merveilleuse

@Funsett Жыл бұрын

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

@jarlsoars1150 Жыл бұрын

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

@tristanstaschik3099 Жыл бұрын

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

@prakhargupta2102 Жыл бұрын

nice video

@benjaminandersson2572 2 жыл бұрын

Very good!

@adarkatz9072 2 жыл бұрын

WOW great !

@williameverett54 2 жыл бұрын

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

@ihsansvlogs8942 2 жыл бұрын

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

@vortex8513 2 жыл бұрын

Thanks for the explanation keep up the good work

@Lord_K_Original 2 жыл бұрын

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

@bobbun9630 2 жыл бұрын

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.

@casualtravelers5847 2 жыл бұрын

This is very interesting! I hope you don't mind my adding your video to my custom M.C. Escher playlist! kzbin.info/aero/PLjoG5aXflB9woFTm0Q_yFCZICCejQb_3u