The n=17 square packing problem is the challenge of fitting 17 unit squares into the smallest possible square container.

This post proposes a new lower bound of 4.4811 on the size of the container.

The proof was written by GPT 5.6 Sol.

It's soldered to the rebar, which is grounded through the actual power cable

Thank you!

Thank you!

I had to wheel the stand into the office on a trolley, I'm not making a laptop case lol

It's an English (UK) keyboard layout

It's very liberating, crafting something for yourself with no intention of selling.

Yes! Trying to make something that other people want is a good way to take the joy out of a project, and it dulls the uniqueness that could the result something truly special.

It's an honour just to be nominated <3

Have your office's PAT test guys flagged those exposed mains cables yet? :)

If it works, it works

I'm glad to hear you liked the post!