Compare commits

...

2 Commits

Author SHA1 Message Date
filifa 193a2ac033 add footnote 2026-06-10 18:42:18 -04:00
filifa 4a31fd3f4a add bored page 2026-06-08 18:38:56 -04:00
3 changed files with 76 additions and 7 deletions
+59
View File
@@ -0,0 +1,59 @@
<!doctype html>
<html lang="en-US">
<head>
<meta charset="utf-8" />
<meta name="viewport" content="width=device-width,initial-scale=1" />
<link rel="stylesheet" href="/styles/default.css" />
<link rel="icon" href="/images/favicon.ico" />
<title>I'm bored.</title>
</head>
<body>
<header>
<a id="homelink" href="/">dairydemon.net</a>
</header>
<main>
<article>
<h1>I'm bored.</h1>
<h2>Word games</h2>
<ul>
<li><strong><a href="https://www.theatlantic.com/games/bracket-city/">Bracket City</a>: Daily game. Easier to play than explain.</strong></li>
<li><a href="https://www.sporcle.com/acrostic/">Sporcle Daily Acrostic</a>: Daily game.</li>
<li><a href="https://raddle.quest/">Raddle</a>: Daily game. The tutorial explains it better than I can.</li>
</ul>
<h2>Trivia games</h2>
<ul>
<li><a href="https://www.sporcle.com/">Sporcle</a>: Just in case you haven't heard of it.</li>
<li><strong><a href="https://thrice.geekswhodrink.com/">Thrice</a>: Fun daily trivia game.</strong></li>
<li><a href="https://www.qbreader.org/">QB Reader</a>: Play quizbowl!</li>
<li><strong><a href="https://catfishing.net/">Catfishing</a>: Daily game. Guess Wikipedia articles from their category lists.</strong></li>
</ul>
<h2>Logic games</h2>
<ul>
<li><a href="https://www.chiark.greenend.org.uk/~sgtatham/puzzles/">Simon Tatham's Portable Puzzle Collection</a>: A bunch of puzzle games. Some of my favorites are Map, Mines, Net, Rectangles, Singles, and Untangle.</li>
<li><a href="https://www.puzzle-star-battle.com/">Puzzle Team</a>: Some overlap with Simon Tatham's, but also has some fun ones like Star Battle.</li>
<li><strong><a href="https://puzzmallow.com/buzzled">Buzzled</a>: Fun daily logic puzzle game.</strong></li>
<li><a href="https://puzzarium.com/every-5x6-nonogram">Every 5x6 Nonogram</a>: I think this is technically an MMO?</li>
</ul>
<h2>More games</h2>
<ul>
<li><a href="https://redactle.net/">Redactle</a>: Daily game. Guess a Wikipedia article word-by-word.</li>
<li><a href="https://www.sports-reference.com/immaculate-grid/">Immaculate Grid</a>: Daily game. I only occasionally play the baseball flavor of this one, and I'm pretty bad at it.</li>
<li><strong><a href="https://enclose.horse/">Enclose.horse</a>: Daily game where you enclose a horse. (The tutorial explains it better than I can.) Very cute design, which masks how challenging the puzzles can be.</strong></li>
<li><a href="https://nandgame.com/">NandGame</a>: Build a computer from scratch.</li>
<li><a href="https://boredzebra.com/100jumps/">100 Jumps</a>: Self-explanatory.</li>
<li><a href="https://rose.systems/animalist/">List Animals Until Failure</a>: Self-explanatory.</li>
<li><a href="https://backofyourhand.com/">Back of Your Hand</a>: How well do you know your neighborhood?</li>
<li><a href="https://www.thewikigame.com/">The Wiki Game</a>: Click from one random Wikipedia article to another.</li>
</ul>
</article>
</main>
<footer>
<p id="copyright">© 2026 filifa. This page is licensed under <a href="https://creativecommons.org/licenses/by-sa/4.0/">CC BY-SA 4.0</a>.</p>
</footer>
</body>
</html>
+1
View File
@@ -29,6 +29,7 @@
<p>Even worse, it's mostly stuff for <em>computer dweebs</em>. :((</p> <p>Even worse, it's mostly stuff for <em>computer dweebs</em>. :((</p>
<ul> <ul>
<li>If you're just bored, <a href="bored.html">see here</a>.</li>
<li>If you like trivia, try this <a href='mgs/mgs.html'>Metal Gear Solid trivia game I made</a>.</li> <li>If you like trivia, try this <a href='mgs/mgs.html'>Metal Gear Solid trivia game I made</a>.</li>
<li>If you're a computer dweeb, take a look at <a href="https://scm.dairydemon.net">my software forge</a>.</li> <li>If you're a computer dweeb, take a look at <a href="https://scm.dairydemon.net">my software forge</a>.</li>
+16 -7
View File
@@ -20,6 +20,7 @@
<hgroup> <hgroup>
<h1>Sums of Powers</h1> <h1>Sums of Powers</h1>
<p>Posted <time datetime="2026-04-15">April 15, 2026</time></p> <p>Posted <time datetime="2026-04-15">April 15, 2026</time></p>
<p>Updated <time datetime="2026-06-10">June 10, 2026</time></p>
</hgroup> </hgroup>
<p>This page is all about how we can efficiently compute large sums of <p>This page is all about how we can efficiently compute large sums of
@@ -402,7 +403,7 @@
<p>This algorithm is quadratic in the value of <p>This algorithm is quadratic in the value of
<math><mi>p</mi></math>, which isn't great, but it's simple to <math><mi>p</mi></math>, which isn't great, but it's simple to
implement (and I don't know of any faster way).</p> implement.<sup>1</sup></p>
<section> <section>
<h4>Stirling numbers calculator</h4> <h4>Stirling numbers calculator</h4>
@@ -460,7 +461,7 @@
<p>It turns out there is a very elegant identity relating <p>It turns out there is a very elegant identity relating
exponents, Stirling numbers, and falling exponents, Stirling numbers, and falling
factorials:<sup>1</sup></p> factorials:<sup>2</sup></p>
<div class="math-block"> <div class="math-block">
<math display="block"> <math display="block">
<mrow> <mrow>
@@ -836,8 +837,8 @@
</math> </math>
</div> </div>
<p>(For <math><mi>p</mi><mo>=</mo><mn>0</mn></math>, the sum is <p>(For <math><mi>p</mi><mo>=</mo><mn>0</mn></math>, the sum is
just <math><mi>n</mi></math>.)<sup>2</sup> This lets us just <math><mi>n</mi></math>.)<sup>3</sup> This lets us
simplify.<sup>3</sup></p> simplify.<sup>4</sup></p>
<div class="math-block"> <div class="math-block">
<math display="block"> <math display="block">
@@ -1057,13 +1058,21 @@
<section> <section>
<h2>Footnotes</h2> <h2>Footnotes</h2>
<ol id="footnote-list"> <ol id="footnote-list">
<li><sup>1</sup> For proofs of this identity, see chapter 1.9 of <li><sup>1</sup> I think we can technically compute all the Stirling
numbers we need in linearithmic time by applying the convolution
theorem to the numbers' explicit sum formula, but that approach
makes it difficult to get exact values. If you just want the
Stirling numbers modulo a prime, you could maybe use a
<a href="https://en.wikipedia.org/wiki/Discrete_Fourier_transform_over_a_ring">number-theoretic transform</a>,
but that's well outside my wheelhouse so I'm not going to touch
on that here.</li>
<li><sup>2</sup> For proofs of this identity, see chapter 1.9 of
<cite>Enumerative Combinatorics</cite> by Stanley and chapter 6.1 <cite>Enumerative Combinatorics</cite> by Stanley and chapter 6.1
of <cite>Concrete Mathematics</cite> by Graham, Knuth, and of <cite>Concrete Mathematics</cite> by Graham, Knuth, and
Patashnik.</li> Patashnik.</li>
<li><sup>2</sup> See chapter 2.6 of <cite>Concrete <li><sup>3</sup> See chapter 2.6 of <cite>Concrete
Mathematics</cite> for an explanation of this identity.</li> Mathematics</cite> for an explanation of this identity.</li>
<li><sup>3</sup> A version of this formula is also mentioned in <li><sup>4</sup> A version of this formula is also mentioned in
chapter 6.5 of <cite>Concrete Mathematics</cite>.</li> chapter 6.5 of <cite>Concrete Mathematics</cite>.</li>
</ol> </ol>
</section> </section>