Christian Lawson-Perfect is a user on mathstodon.xyz. You can follow them or interact with them if you have an account anywhere in the fediverse.

Christian Lawson-Perfect @christianp@mathstodon.xyz

Chocolate games that satisfy the inequality \(y \leq \left \lfloor \frac{z}{k} \right\rfloor\) for \(k=1,2\) and Grundy numbers
Article by
In collections: Attention-grabbing titles, Games to play with friends, Food
We study chocolate games that are variants of a game of Nim. We can cut the chocolate games in 3...
URL: mi.sanu.ac.rs/vismath/miyadera
Entry: read.somethingorotherwhatever.

is this baby on mastodon because she sure does toot a lot

Classic DOS platformer Jazz Jackrabbit, its Widows sequel, and Epic Pinball were added to GOG's catalog!
gog.com/game/jazz_jackrabbit_c

I've just learnt about Duffinian numbers. They're composite numbers which are coprime to the sum of their divisors.

In addition: Numbers Aplenty is a terrific site: numbersaplenty.com/set/Duffini

Wow, @esoterica has over a hundred followers!
That pleases me a lot.

Milestone is to minestrone as baseline is to vaseline.

(oh, and the link in the description doesn't go to the paper, it just goes to the journal's homepage. So much value!)

I love the Journal of Number Theory's video abstracts.
This one by Sungkon Chang is great, building on Zeckendorf's theorem: youtube.com/watch?v=vSwSJ_sppn
(Yes, Elsevier is garbage. They haven't added much value here: the video is Chang's own work, and they haven't even gone to the effort of writing proper closed captions)

Morty! You turned yourself into a WebAssembly demo! And, and, burp, and and, *pwfff*, and you're very elastic it appears adultswim.com/etcetera/elastic

91. MORE MIXED FRACTIONS. When I first published my solution to the last puzzle, I was led to attempt the expression of all numbers in turn up to 100 by a mixed fraction containing all the nine digits. Here are twelve numbers for the reader to try his hand at: 13, 14, 15, 16, 18, 20, 27, 36, 40, 69, 72,
94. Use every one of the nine digits once, and only once, in every case.

Pancake Flipping is Hard
Article by Bulteau, Laurent and Fertin, Guillaume and Rusu, Irena
In collections: Attention-grabbing titles, Puzzles, Basically computer science, Easily explained
Pancake Flipping is the problem of sorting a stack of pancakes of different sizes (that is, a permutation), when the only allowed operation is to insert a spatula...
URL: arxiv.org/abs/1111.0434
PDF: arxiv.org/pdf/1111.0434v2
Entry: read.somethingorotherwhatever.

Some more numbers that look like this:
4331 = 61*71
1271 = 31*41
7171 = 71*101
6161 = 61*101

Today I noticed that 2501 = 41*61, which is quite nice because it's a product of two large primes.
The optimal for this is, I guess, the product of a pair of twin primes (I rule out square numbers cos they're boring). Those numbers are oeis.org/A037074

But I feel like there's something extra-nice about 2501=41*61. Is it the matching final digit?