Are you generating all combinations of size 3 from each of the 7 four digit
combinations. Or are you generating 3 digit combinations from the pool of 7
* 4 = 28 numbers? It is unclear to me what you are actually doing to get
your results.

--
Regards,
Tom Ogilvy





Dizzy wrote in message
le.rogers.com...
Hi all,

Given some parameters N,k,t,B where N=k=t and B1
- Generate B random combinations from 1 to N of size k
- Calculate the unique and overlapping combinations of size t
that belong to the B combinations.

Ex:
N=12 k=4 t=3 B=7

1 2 4 5
1 3 6 7
1 3 10 11
2 7 9 11
3 4 5 8
1 2 3 6
4 6 7 9

My results a
Combinations appearing once =10
twice =288
3 times=190
4 times=7

How can we count the above faster that brute force?

TIA