IMO C
suppose 1) Language Q could have both 3 or 2 code symbols, for example. The code group would be in the two cases:
a) A,B, AB;
b) A,B,C,AB,AC,BA,BC,CA,CB,ABC,ACB,BAC,BCA,CAB,CBA;
It is consisten with 1
so INSUFFICIENT
suppose 2) could, again, be both the language of all of the horizontal arrangements of one or more distinct code symbol among A,B,C (b) and the language of one code symbol among 15 code symbols (A;B;C;D;E;F;G;H;I;J;K;L;M;N,O)-> INSUFFICIENT
suppose 1) and 2) the number of code groups with these assumptions are f(n)=n+n*(n-1)+n*(n-1)*(n-2)+...+n! where n is the number of code symbols.
For example for n=3 we have 3 single code symbols (A,B,C), 3*2 2-code symbols strings (AB,AC,BA,BC,CA,CB) and 3*2*1
3-code symbols strings (ABC,ACB,BAC,BCA,CAB,CBA)
3+3*2+3*2*1=15 so 3 code symbols fit well our problem. However f(n) in increasing so only n=3 can be the answer so this is SUFFICIENT.
Last edited by
simone88 on Sat Apr 28, 2012 5:12 am, edited 1 time in total.
