Image transcription: “Fibonacchos” The Fibonacci sequence laid out in Nacho’s (Tortilla Chips). Credits: Cliff Pickover
(Originally published earlier today on infosec.exchange)
F(nachos) = F(nachos-1) + F(nachos-2) [i0null@infosec.exchange]
Image transcription: “Fibonacchos” The Fibonacci sequence laid out in Nacho’s (Tortilla Chips). Credits: Cliff Pickover
(Originally published earlier today on infosec.exchange)
4 Comments
sbank@hachyderm.io · 2 pts · 2y
two, three, five, ate; who do we appreciate? Fibbonachos!
HolgerTDittmann@ruhr.social · 1 pts · 2y
Nice party game, who can eat the highest Fibonacho number of nachos.
MR_E@infosec.exchange · 1 pts · 2y
planning is getting even more ridiculous.
auscandoc@med-mastodon.com · 1 pts · 2y
May I say how much I enjoyed that?