1Frame A and Frame B combine into Frame C, keeping every dot that appears in either frame. Study the two worked examples above, then choose the option that correctly completes Frame A + Frame B in the last row.
Show answer & explanation
Answer: <svg xmlns="http://www.w3.org/2000/svg" width="62" height="62" viewBox="0 0 62 62"><rect x="0" y="0" width="62" height="62" fill="#efeade" stroke="#211d16" stroke-width="1.4" rx="4"/><polygon points="31.0,6.0 52.7,18.5 52.7,43.5 31.0,56.0 9.3,43.5 9.3,18.5" fill="#fffdf7" stroke="#3a4a63" stroke-width="1.8"/><circle cx="31.0" cy="6.0" r="4" fill="#8a3b2b" stroke="#1c1a15" stroke-width="1.1"/><circle cx="52.7" cy="18.5" r="4" fill="#8a3b2b" stroke="#1c1a15" stroke-width="1.1"/><circle cx="52.7" cy="43.5" r="4" fill="#8a3b2b" stroke="#1c1a15" stroke-width="1.1"/></svg>
FRAME C must contain every dot that appears in FRAME A or FRAME B — a logical OR of the two source frames, not an overlap-only AND. Example 1 shows A={0,4} combined with B={3,4} to make C={0,3,4}: every dot from either source survives. Example 2 confirms the same rule with A={3,5} and B={0,4} making C={0,3,4,5}. For the final row, A={0,2} and B={1,2}, so the correct sum is every corner in either set: {0,1,2} — choice D. Verify by listing A3's corners, then B3's corners, then merging the two lists and removing repeats; that merged list should match choice D exactly. Each wrong choice fails for a specific, checkable reason: one keeps only the corners common to both frames (an AND instead of an OR), one is missing a dot that should have carried over from one of the source frames, and one has an extra dot at a corner that never appeared in A3 or B3 at all.
FRAME C must contain every dot that appears in FRAME A or FRAME B — a logical OR of the two source frames, not an overlap-only AND. Example 1 shows A={0,4} combined with B={3,4} to make C={0,3,4}: every dot from either source survives. Example 2 confirms the same rule with A={3,5} and B={0,4} making C={0,3,4,5}. For the final row, A={0,2} and B={1,2}, so the correct sum is every corner in either set: {0,1,2} — choice D. Verify by listing A3's corners, then B3's corners, then merging the two lists and removing repeats; that merged list should match choice D exactly. Each wrong choice fails for a specific, checkable reason: one keeps only the corners common to both frames (an AND instead of an OR), one is missing a dot that should have carried over from one of the source frames, and one has an extra dot at a corner that never appeared in A3 or B3 at all.