Impressive. Might have to get myself a 5 for Christmas!

Nice! What is the screen resolution? I tried some Shadertoys on a Pi 2 a while back - worked nicely, but so slow (this was with an HD screen).

The n = 0 case works nicely here too - take a 1x1 grid, black out the single square, the remaining 0 squares can be tiled with 0 trominos.

How about the n = 0 case? The product of 0 functions is constant 1 whose derivative is the sum of 0 values, which is 0. Taking 0 and 1 for the sum and product of the empty set is exactly what is needed to make this sort of trivial base case work out.

Courtesy of diamondgeezer.blogspot.com/2024/02/poly...

Look at the red dots, one 9x9 square, then 16 rectangles that pair up to make another 8 9x9 squares, make 9³ altogether.

Here's a picture:

Great! Mentions the SSEC, which I'd never come across, excellent film extract here: www.youtube.com/watch?v=eKkn...