MATH!
In case you ever wanted to know, Kasadkad on IRC shared some very useful math:
"If you have n urinals, the number of ways to arrange people at them so that no one is next to anyone else is F(n+2) - 1, where F(k) is the kth Fibonacci number"
The Fibonacci numbers are a sequence in which a number an = an - 1 + an - 2 where a is a number in the ( Read more... )
"If you have n urinals, the number of ways to arrange people at them so that no one is next to anyone else is F(n+2) - 1, where F(k) is the kth Fibonacci number"
The Fibonacci numbers are a sequence in which a number an = an - 1 + an - 2 where a is a number in the ( Read more... )
Comments 2
Reply
Reply
Leave a comment