Sep. 2nd, 2006

flexagon: (Default)
(This teaser arose naturally from a discussion of concurrence and thread-safety we were having at work yesterday. But I liked it! What an evil interview question it would make.)

If you have two ordered sequences of length 3, for example abc and xyz, there are 20 ways in which you can interleave them while keeping the order of each sequence intact. I won't list all 20, but for example:

abcxyz, abxycz, axbyzc, ... xyzabc.

How many ways can you interleave two sequences of length m and n? We're looking for a closed-form mathematical expression here and will not be impressed by a program that just generates all possibilities (sorry [livejournal.com profile] jg26).

As a reassurance: an elegant answer exists. [livejournal.com profile] heisenbug already got it so he's not allowed to give the answer away here. ^_^

Profile

flexagon: (Default)
flexagon

August 2025

S M T W T F S
     1 2
3456789
101112131415 16
17181920212223
24 252627282930
31      

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags
Page generated Aug. 29th, 2025 12:11 am
Powered by Dreamwidth Studios