Python, 184 bytes This is based on Mego's example implementation, except golfed further. import math def n(n,r):f=math.factorial;return f(n)/f(r)/f(n-r) def B(m): if m==0:return 1 if m%2!=0 and m!=1:return 0 t=0 for k in range(0,m):t+=n(m, k)*B(k)/(m-k+1.0) return 1-t Try it online.

StackyMath (TBD, most likely code-golf or code-challenge) Time for you to implement my new stack based language! It's called StackyMath (as if you didn't already know :). This will be a stack based language with 7 operations on the stack and ways to add numbers to the stack. List of operations...

So, like the title says, today you are going to guess my password (sort of). You need to make a big long list of every possible password I might be using on my 4 digit online vault. Specifications: It could contain any 26 letters of the alphabet in UPPER CASE. It could contain any numbers 0-9...

Ruby, 64 bytes [*'A'..'Z',*'0'..'9'].repeated_permutation(4){|a|puts a.inspect} Probably golfable further, I'm not that good at Ruby.

Ruby, 64 bytes [*'A'..'Z',*'0'..'9'].repeated_permutation(4){|a|puts a.inspect} Probably golfable further, I'm not that good at Ruby.