If S = {1,...,50}, and K is the set of all sequences of length 10 with elements from S such that for all ordered pairs in SxS, they appear only once in that order in some sequence in K. Whats the best upper bound for |K|?
what are u trying to say