I just purchased the game Spot It. As per this site, the structure of the game is as follows:

Game has 55 round playing cards. Each card has eight randomly placed symbols. There are a total of 50 different symbols through the deck. The most fascinating feature of this game is any two cards selected will always have ONE (and only one) matching symbol to be found on both cards.

Is there a formula you can use to create a derivative of this game with different numbers of symbols displayed on each card.

Assuming the following variables:

- S = total number of symbols
- C = total number of cards
- N = number of symbols per card
Can you mathematically demonstrate the minimum number of cards (C) and symbols (S) you need based on the number of symbols per card (N)?

**Answer**

The celebrated Ray-Chaudhuri–Wilson theorem states that C≤S, contradicting your numbers.

An almost matching construction is as follows. Pick some prime number n. Our universe, of size n2+n+1, consists of pairs of numbers in {0,…,n−1} plus n+1 singletons {0,1,…,n−1,∞} (“points at infinity”). For each 0≤a≤n−1 and 0≤b≤n−1 we will have a card of size n+1 containing the pairs \{(x,ax+b \mod{n})\} and the singleton a. There are also n special cards, for each 0 \leq c \leq n-1, containing the pairs \{(c,x)\} and the singleton \infty. One super special card contains all n+1 singletons.

Clearly two cards with the same a intersect only at the singleton. Two cards with different as intersect at the unique solution to a_1x+b_1 = a_2x+b_2 \pmod{n}. Two special cards intersect only at the singleton, and a normal and a special card intersect at (c,ac+b). Finally, the super special card intersects the rest at a singleton.

In total, we have n^2+n+1 cards and symbols, each card containing n+1 symbols, and two cards intersecting at exactly one symbol. In your case n=7 and so the number of cards and symbols should be 7^2+7+1 = 57.

**Attribution***Source : Link , Question Author : Javid Jamae , Answer Author : amWhy*