this post was submitted on 21 May 2025
706 points (97.7% liked)

memes

14864 readers
5485 users here now

Community rules

1. Be civilNo trolling, bigotry or other insulting / annoying behaviour

2. No politicsThis is non-politics community. For political memes please go to !politicalmemes@lemmy.world

3. No recent repostsCheck for reposts when posting a meme, you can only repost after 1 month

4. No botsNo bots without the express approval of the mods or the admins

5. No Spam/AdsNo advertisements or spam. This is an instance rule and the only way to live.

A collection of some classic Lemmy memes for your enjoyment

Sister communities

founded 2 years ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] iAvicenna@lemmy.world 69 points 22 hours ago* (last edited 22 hours ago) (1 children)

I will be the cpt obv

1/3 1/3

<=======]==o

2/3 2/3

[–] idunnololz@lemmy.world 12 points 15 hours ago (6 children)

Ok but like how do you know it's 1/3 of the apple without any other tools.

[–] fargeol@lemmy.world 1 points 17 minutes ago

You don't, you only know it's possible to do so thanks to the Ham sandwich theorem

[–] JackbyDev@programming.dev 7 points 6 hours ago (1 children)

What's funny is that you've actually stumbled onto an entire problem that's studied quite heavily. I remembered a Numberphile video about this. The problem is called "envy-free cake splitting". It's pretty straightforward. A split is envy-free if no one believes someone else got more than them. For three people this was figured out in 1960 and you can read about it here. It has been solved for N participants as well and you can read about the general problem here.

For two people, it's obvious. One splits and one chooses. The first person is incentivized to make it even because they don't know which they'll get.

I was going to give a summary of the process for three people but it's too much to explain succinctly. Just check the article I posted lol.

[–] iAvicenna@lemmy.world 1 points 2 hours ago (2 children)

How is it obvious for two people, what if I have horrible manual dexterity and despite my best efforts, I slice the cake like 1/3 and 2/3, and the other person picks the bigger piece? I would very much envy the other piece

[–] Krauerking@lemy.lol 1 points 1 hour ago

Then have them cut and you choose. Easy. Now they envy your piece and having better dexterity as well.

Insert Thanos balanced meme here.

[–] JackbyDev@programming.dev 1 points 1 hour ago (1 children)

Your "cut" would not be complete until you believe you've made them 50/50.

[–] iAvicenna@lemmy.world 1 points 1 hour ago

here we go infinite cuts

[–] iAvicenna@lemmy.world 4 points 9 hours ago* (last edited 9 hours ago)

it is a magical long sword of apple slicing (+5 damage and THAC0 against apples, +1 otherwise)

[–] blarth@thelemmy.club 12 points 12 hours ago (1 children)

Let’s not go too deep on this alright

[–] JackbyDev@programming.dev 1 points 6 hours ago (2 children)
[–] tetris11@feddit.uk 1 points 23 minutes ago* (last edited 21 minutes ago)

if the cake is a 1-dimensional interval ....
The Stromquist moving-knives procedure uses four simultaneously-moving knives....

Consider a spherical cow perched above a black hole, facing the sunset....

[–] iAvicenna@lemmy.world 1 points 2 hours ago (1 children)

I did not expect to see this today

[–] JackbyDev@programming.dev 1 points 1 hour ago* (last edited 1 hour ago)

To put that in perspective, for 2 people that would be ~4.3 billion

[–] ghen@sh.itjust.works 9 points 12 hours ago (1 children)

Cut first, choose last. It's as fair as you can get when eyeballing it

[–] JackbyDev@programming.dev 2 points 6 hours ago

Only works with two people. For three you use Selfridge-Conway procedure](https://en.wikipedia.org/wiki/Selfridge%E2%80%93Conway_procedure) which uses up to five cuts.