========================================================
Explanation:
The order doesn't matter. A group like {A,B,C} is the same as {B,A,C}.
All that matters is the overall group rather than the positioning of the members.
We'll use the nCr combination formula since order doesn't matter.
The value of n is unknown, but we know that r = 3 members are to be selected.
Let's pick a value for n at random. Let's say n = 10.
Plug n = 10 and r = 3 into the nCr formula below.
Unfortunately we don't reach 365 or larger.
Let's try n = 11
We're still under our target. The good news is that the nCr value is increasing.
So the idea is to do trial and error with various values of n. Keep incrementing n until nCr = nC3 is equal to 365 or larger.
Here's a table of values where r = 3 the entire time
The nCr values are also found in Pascal's Triangle. Each of those values are the fourth entry of each row.
When n = 14, we have nCr = 364 which is very close. We're one short unfortunately.
So we have to go for <u>n = 15</u> instead. This makes the nCr value well over 365 of course, but it guarantees that you'll have plenty of trios to choose from such that no group of three is repeated. Unfortunately some trios will be left out.