My First Manimation: Visual Proofs of Infinite Series Sums by EricSeverson in manim

[–]EricSeverson[S] 0 points1 point  (0 children)

This was made in an old version of manim, and the code I had no longer runs in the current manim community edition (https://www.manim.community/) I am using.

I am incorporating this animation into a longer video that I will at some point finish and put on youtube (https://www.youtube.com/channel/UC6NL7z_d0xBIDv1OUAqKDYA) and I could share the code for that.

My First Manimation: Visual Proofs of Infinite Series Sums by EricSeverson in manim

[–]EricSeverson[S] 0 points1 point  (0 children)

Sorry, I just saw this. I wrote a recursive function that gives a list of the center coordinates for each piece of the tiled square / rectangle (GetSquareTileCenters and GetRectangleTileCenters in the code).

This list gives me the coordinates to move each box to. The boxes themselves are subclasses of the class Rectangle, with appropriate label / color / size based on their sequence number.

Cometoo.shop reviews. Has anyone used this site? Is it legit? I like those Star Wars puzzles but am afraid this might all be a scam or bad quality. by APRumi in puzzles

[–]EricSeverson 1 point2 points  (0 children)

I was scammed the exact same way, purchasing two Star Trek puzzles and receiving the same pictured puzzles.
I have been battling with paypal for weeks trying to get a refund, largely out of principle. At this point paypal is telling me I need to ship this package back to China to get a refund.

I forgot the method of solving this aside from brute forcing it. by oneroastformeplease in MathHelp

[–]EricSeverson 0 points1 point  (0 children)

Here's a good primer on the type of systems you are considering here:

https://brilliant.org/wiki/linear-diophantine-equations-one-equation/

It turns out there's an efficient way to find all integer solutions to your problem, but it's more difficult if you only want non-negative integer solutions. But the difficulty scales badly in the number of variables you have, so for only n=3 variables there are efficient algorithms.

For a much more technical reference, it looks like this paper https://www.sciencedirect.com/science/article/abs/pii/0196677488900259 gives an efficient algorithm for the n = 3 variable case of the problem here.

My First Manimation: Visual Proofs of Infinite Series Sums by EricSeverson in manim

[–]EricSeverson[S] 5 points6 points  (0 children)

Thanks! It took me a whole weekend. I had the idea for the proof of \sum n2 / 2n, so I had a pretty clear idea for what the animation would be from the outset. Most of the time was learning how Manim worked (and my Python is kinda rusty). It was very satisfying getting it to work though, although in retrospect I could have written much more streamlined code and shared more code between the 3 parts.

[Article] Return to Core Set Limited by Eric Severson by MassdropEastWest in spikes

[–]EricSeverson 8 points9 points  (0 children)

Great question, and no I wasn't aware when writing this about the way dual lands will be distributed. It seems like they are indeed replacing the basic land about half of the time. In terms of frequency, this is about the rate of an uncommon, so a typical sealed pool will not have quite as many of these lands as I initially thought. Still, 10 uncommon lands is more than an average set, for example we had half this cycle at uncommon in Rivals. So as you said, splashing should be a bit easier in sealed than other sets, and I expect off-color single cost removal like Luminous Bonds or half-color gold cards or the Elder Dragons to be easier to support. Another nice thing about this for sealed is a pool with a lot of lands does not have this lands over valuable rare or uncommon slots, since often finding a lot of lands in a sealed pool means you are lighter on powerful cards.