![F(nachos) = F(nachos-1) + F(nachos-2) [i0null@infosec.exchange]](https://media.infosec.exchange/infosec.exchange/media_attachments/files/111/901/429/485/104/172/original/b9656ff8b50ac9a8.jpeg){kind=link}
Image transcription: “Fibonacchos” The Fibonacci sequence laid out in Nacho’s (Tortilla Chips). Credits: Cliff Pickover
(Originally published earlier today on 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)
Nice party game, who can eat the highest Fibonacho number of nachos.