@christianp Kepler's answer is this one: https://mathworld.wolfram.com/KeplersMonsters.html

@zachweinersmith.bsky.social Factoring *does* reduce to any NP-hard problem. If you had a magical solver for any NP-hard problem, then you could use it to factor integers into primes.

Factoring is not known to be NP-hard, which means that even if you had a magical factoring-into-primes machine […]

Behold its shadow.

Seriously though i’m biased because i’m a fiber arts sicko but if you want to see a c. 1500 masterpiece in paris i highly recommend skipping the mona lisa and seeing the lady and the unicorn tapestries:

- way less people
- rabbits
- you can get like 1 […]

[Original post on posts.rat.pictures]

The specific page that prompted me to post about this book is the description of how the first stellation of the rhombic dodecahedron can be dissected into six congruent pieces (and, in passing, that it can also fill space)

@zachweinersmith.bsky.social Hidden moon base, obviously 🙄

I must find an excuse to do this in a lesson— we do this one point perspective thing on proportions— but five points are more fun.

Anyway, I've asked the Linus Tech Tips guys if they would run the n=13 search, over at https://linustechtips.com/topic/1612153-this-world-record-took-years-and-a-million-dollars/page/2/#comment-16732910. We'll see if they take me up on it.

If not, maybe I'll actually do the n=12 version myself […]

Well, with 300 trillion digits, you are almost certain to have seen all 12-digit sequences, and if the digits were random then there would be around a 39.2% chance that you'd have seen all 13-digit sequences. With only 200T digits there would be no chance.

These probability comes from a tail […]

There's no proof, but pi is probably a normal number (https://en.wikipedia.org/wiki/Normal_number), meaning in particular that every sequence of n decimal digits should appear in it, in approximately 1/(10^n) of the possible locations. (That's what you would expect if the digits were random […]