A set of 1990 persons is divided into non-intersecting subsets in such a way that

1. No one in a subset knows all the others in the subset,

2. Among any three persons in a subset, there are always at least two who do not know each other, and

3. For any two persons in a subset who do not know each other, there is exactly one person in the same subset knowing both of them.

(a) Prove that within each subset, every person has the same number of acquaintances.

(b) Determine the maximum possible number of subsets.
       
Note: It is understood that if a person $A$ knows person $B$, then person $B$ will know person $A$; an acquaintance is someone who is known.  Every person is assumed to know one's self.
### Part (a): Prove that within each subset, every person has the same number of acquaintances.

1. **Graph Representation**:
   - Represent the problem using a graph \( G \) where each person is a vertex and an edge between two vertices indicates that the two people know each other.
   - The conditions given translate to properties of this graph:
     - No one in a subset knows all the others in the subset.
     - Among any three persons in a subset, there are always at least two who do not know each other.
     - For any two persons in a subset who do not know each other, there is exactly one person in the same subset knowing both of them.

2. **Complementary Graph**:
   - Consider the complementary graph \( \overline{G} \) where an edge between two vertices indicates that the two people do not know each other.
   - The third condition implies that for any two non-adjacent vertices \( A \) and \( B \) in \( G \), there is exactly one vertex \( C \) such that \( A \) and \( B \) are both adjacent to \( C \) in \( G \).

3. **Degree Argument**:
   - Let \( A \) and \( B \) be two people who do not know each other. They have exactly one common acquaintance \( C \).
   - For each acquaintance \( D_a \neq C \) of \( A \), there is exactly one common acquaintance \( D_b \neq C \) of \( D_a \) and \( B \).
   - This implies that the number of acquaintances of \( A \) and \( B \) must be the same, as they can be paired up uniquely.

4. **Connected Components**:
   - In \( \overline{G} \), if there are at least two components each with at least 2 vertices, there will be 4 vertices \( a_1, a_2, b_1, b_2 \) such that \( a_i \) and \( b_j \) are connected for \( i, j = 1, 2 \), which contradicts the given conditions.
   - If \( \overline{G} \) has at least two components, one of which has exactly one vertex, then that vertex is connected to all others, leading to a contradiction.
   - Therefore, \( \overline{G} \) must be connected.

5. **Conclusion**:
   - Since \( \overline{G} \) is connected and all vertices in \( G \) have the same degree, it follows that within each subset, every person has the same number of acquaintances.

### Part (b): Determine the maximum possible number of subsets.

1. **Graph Size**:
   - We need to find the maximum number of subsets such that each subset satisfies the given conditions.
   - The smallest graph \( G \) that satisfies the conditions is a 5-cycle (a pentagon), where each vertex has exactly 2 acquaintances.

2. **Dividing the Set**:
   - Given 1990 persons, we can divide them into subsets of 5 persons each.
   - The number of such subsets is \( \frac{1990}{5} = 398 \).

3. **Verification**:
   - Each subset of 5 persons forms a 5-cycle, satisfying all the given conditions.
   - Therefore, the maximum possible number of subsets is 398.

The final answer is \( \boxed{398} \)