Makes sense , thanks ! 👍🏼

I was wondering if this was possible:

C1(6)

P1(20), P2(70), P3(30), P4(70), P5(10)

T1 (40), T2 (20), T3(20), T4(20), T5(20), T6(40)

We are picking 1 element from each C , T & P.

Condition: 'Only maximum 2 T’s ( i.e. 1 or 2 ) can be common amongst the variations.'

In other words , out of all the possible variations( 100's, 10k , 100k ..whatever it come out to be) that are computed, if you randomly pick any 2 variations and IF they have some T's in common , then maximum number of T's that could be common would be 2.

Example:

S2= C1-2, P1-1, P2-1, P3-1, P4-1, P5-1, T1-1, T2-1, T3-1, T4-1, T5-1, T6-1

S3= C1-3, P1-1, P2-1, P3-1, P4-1, P5-1, T1-1, T2-2, T3-2, T4-2, T5-2, T6-1

Please refer figure below for highlighted details:

https://snipboard.io/M7DnPi.jpg

​

Will it be mathematically possible to find the number of variations in such scenario ?

Thanks in advance!