*** Possible spoiler alert! ***

I've been trying to reason out the vocab test given by Oswald & Cornelius outside the courthouse. I figured out the logic of questions #1 and #3, but I'm not able to figure out #2 other than by brute force.

Here are my notes for Q2:

given:
seven robots
each is factor or sturn
each has quad, linear, multi
# factor > # sturn
all linear are factor
no sturn have quad

derived:
4-6 factor
1-3 sturn
factor can have any proc
all sturn are multi
quad: 0-3
linear: 0-6
multi: 0-7

Q2: if exactly 2 factor have same proc, which is true:
1. 1 of 7 robots has quad
2. 2 of 7 have linear
3. 3 of 7 are sturn
4. 4 of 7 have multi
5. 5 of 7 are factor

I'm missing how 2 factorbuilt robots having the same processor limits the problem space sufficiently to derive an answer, especially when there is no limit on processor types for factorbuilt robots (linear implies factorbuilt, but not vice versa).


*** SPOILER ALERT! ***

I know that the answer is option #3, but can anyone explain the logic behind this? Thanks!

Ah, thanks!

I think I wasn't focusing enough on "exactly" in the phrase "exactly two". I had also decided against writing out permutations like your examples, but in retrospect that probably would have helped too.

Hey sorry to barge in, but I still don't understand why there can't be 6 Factor built robots.

With a combination of 1,2,3 of each type and only one Sturnweiler built robot.

All the statements are still true in this scenario.

Five Factorbuilts would have the same processor type in that scenario (two should share Type A and three should share Type B).