6:41 It's funny, in trying to show us that editing the previous command doesn't work, Ben actually showed that it *can* work, when he changed the list given to Enlarge(), but *not* the list given to Vertex().
I just used Claude 3.5 Sonnet to ENTIRELY write a Python program that displays (for user controlled values n, and x) an n level, mod x, (step-pyramid style) 'Pascal's triangle', where every cell has a color corresponding to its mod x value. For 2
Crystal clear, concise, rock solid explanations with great examples! Ben, you make us think outside the triangle, recursively with flattened lists of lists. Thank you for your passion in maths communications. Great channel with excellent content !!
I programmed an n-dimensional node structure way back in the day. It started right here with Sierpienski. I was frustrated with visualizing to myself how iteration worked, so I made a program that drew pretty fractal structures. It's kinda funny how many different pretty patterns come about just by messing with repeating a few simple equations. It was basically a RAM restricted tree structure that performed an equation at each node, plotted a point/colour on screen and cleaned up after itself. The really fun bit was messing with the main equation. I got stuff that looked like Julia fractals, dragons, Lots of Cantor dust. So much self repeating fun.
I love this stuff! I recently made a video explaining why the sierpinski triangle appears in Pascal's triangle, not just for the even/odd colouring but for any prime colouring! It's on my channel if you want to see! (TH-cam doesn't let you put links in comments unfortunately)
6:41 It's funny, in trying to show us that editing the previous command doesn't work, Ben actually showed that it *can* work, when he changed the list given to Enlarge(), but *not* the list given to Vertex().
Really nice how this went, thanks Ben! 👍💪✌
I just used Claude 3.5 Sonnet to ENTIRELY write a Python program that displays (for user controlled values n, and x) an n level, mod x, (step-pyramid style) 'Pascal's triangle', where every cell has a color corresponding to its mod x value. For 2
Crystal clear, concise, rock solid explanations with great examples! Ben, you make us think outside the triangle, recursively with flattened lists of lists. Thank you for your passion in maths communications. Great channel with excellent content !!
I programmed an n-dimensional node structure way back in the day. It started right here with Sierpienski. I was frustrated with visualizing to myself how iteration worked, so I made a program that drew pretty fractal structures. It's kinda funny how many different pretty patterns come about just by messing with repeating a few simple equations.
It was basically a RAM restricted tree structure that performed an equation at each node, plotted a point/colour on screen and cleaned up after itself.
The really fun bit was messing with the main equation. I got stuff that looked like Julia fractals, dragons, Lots of Cantor dust. So much self repeating fun.
That was really awesome. I learned a bunch!
I love this stuff! I recently made a video explaining why the sierpinski triangle appears in Pascal's triangle, not just for the even/odd colouring but for any prime colouring! It's on my channel if you want to see! (TH-cam doesn't let you put links in comments unfortunately)
I can see your channel by clicking on your little pic. :) Thanks for sharing that.
Sparks AND Triangles, what a day!
This is great!
Are you still working as a teacher? Can you include this in your lessons?
Slick!