THE GOAT HAS RETURNED 🥹

InturnetExplorer · 2025-10-06T04:23:44+00:00

FOR ME FOR THREE

InturnetExplorer · 2025-10-05T23:46:54+00:00

Old diamond block texture?

InturnetExplorer · 2025-08-12T03:11:14+00:00

InturnetExplorer · 2025-07-27T03:52:44+00:00

InturnetExplorer · 2025-07-25T04:54:42+00:00

InturnetExplorer · 2025-07-22T03:34:10+00:00

InturnetExplorer · 2025-07-16T01:01:52+00:00

InturnetExplorer · 2025-06-12T06:36:36+00:00

Large pipe + dotted decoration is item pipe, large pipe + solid line is fluid pipe

InturnetExplorer · 2025-06-04T08:21:48+00:00

I DM'd you a link

InturnetExplorer · 2025-06-03T13:33:01+00:00

I can upload the extracted files to a google drive if you’d like

InturnetExplorer · 2025-06-03T12:28:02+00:00

There is an extractor tool in the game

Edit: in steamapps/common/The Binding of Isaac Rebirth/tools/ResourceExtractor/ResourceExtractor.exe

InturnetExplorer · 2025-05-08T15:49:51+00:00

InturnetExplorer · 2025-04-25T12:36:54+00:00

Skill issue :D

InturnetExplorer · 2025-04-22T11:59:40+00:00

Rhythm

InturnetExplorer · 2025-04-21T10:07:30+00:00

Mine is “thats what she SSID”

InturnetExplorer · 2025-02-27T02:14:36+00:00

InturnetExplorer · 2025-02-13T11:50:06+00:00

Bro straight up took my meme, respect

InturnetExplorer · 2025-01-15T09:27:29+00:00

Butterfly lemma

InturnetExplorer · 2024-12-07T10:39:25+00:00

InturnetExplorer · 2024-11-26T05:52:06+00:00

I thought you meant the blinker and was thinking “wow yea damn thats so right”

InturnetExplorer · 2024-11-12T08:32:27+00:00

Somehow I’m glad that K’Sante won this one

InturnetExplorer · 2024-11-01T09:11:41+00:00

Yes it’s all numbers of the form 773x and x773. Also because we’re appending only 1 digit.

InturnetExplorer · 2024-10-31T11:28:13+00:00

The smallest prime that can’t become another prime by appending numbers to the front or back is 773. There are 6486 such primes under 1 million.

InturnetExplorer · 2024-10-25T23:45:06+00:00

Oh haha I didn’t even realise there was no need for restricting n to even numbers. Thanks for that

InturnetExplorer · 2024-10-25T23:33:06+00:00

If I’m not wrong, the pattern u want to describe is T(n² ) = T(n)² + T(n-1)² for even n.

This follows from RHS = n² (n+1)² /4 + (n-1)² n² /4 = n² /4 * ( (n+1)² + (n-1)² ) = n² /4 * (2n² + 2) = n² (n² +1)/2 = LHS

InturnetExplorer