HolgerTDittmann

joined 2 years ago
sorted by: new top controversial old
F(nachos) = F(nachos-1) + F(nachos-2) [i0null@infosec.exchange] in c/tails@lemmon.website
[–] HolgerTDittmann@ruhr.social 1 points 1 year ago* (last edited 1 year ago)

Nice party game, who can eat the highest Fibonacho number of nachos.