In how many ways can three numbers be selected from the numbers $1,2,\dots,300$ such that their sum is divisible by $3$?

Question

Can someone check which logic is finally correct?:

I found different answers about the exact question but everyone states something different.

Dividing $\{1, \dots , 300\}$ into three groups $(A,B,C)$ where each one of them has $100$ numbers in it and ${}\bmod 3$ results in $0$ or $1$ or $2$ seems correct as a first step.

Then if we want the sum of the three numbers to be divisible by $3$ we should take cases:

All of them belong to one of the groups: $ {{100}\choose{3}} + {{100}\choose{3}} + {{100}\choose{3}} $
We take one from each group: $ {{100}\choose{1}} × {{100}\choose{1}} × {{100}\choose{1}} $

The answer ends there by adding the above numbers (because one of them can happen).

But what about combinations such as: Taking one number from the group that gives remainder $1$ and two numbers from the group that gives remainder $2$??

Wouldn't the second bullet be $\binom{100}{1}\times\binom{100}{1}\times\binom{100}{1}$? — Thomas Andrews, Aug 31 '13 at 19:52
If you see it as group, when you pick one number then you can't pick it again. So, I believe yes they are distinct. Sorry for the typo in the formula.... — user2692669, Aug 31 '13 at 19:53
If it is a group, you are still allowed to choose three with replacement... — Thomas Andrews, Aug 31 '13 at 19:54
You still haven't answered my second question - why is the second bullet $\binom{100}{3}^3$ and not $\binom{100}{1}^3$? We are only choosing one from each "group." (I just realized you are not really using the term "group" the way that a mathematician would, but as a synonym for "set" of "equivalence class.") — Thomas Andrews, Aug 31 '13 at 19:57
A mildly surprising fact to me was to see that the probability for the sum of 3 integers, randomly chosen without repetitions from ${1,2,\ldots,3N}$, to be divisible by three is always a bit above $1/3$. This is clear, when $N=1$, and follows easily from the calculations below. — Jyrki Lahtonen, Aug 31 '13 at 21:42
There is a solution to this problem at the following MSE link. — Marko Riedel, Dec 27 '13 at 21:42

score 7 · Accepted Answer · answered Aug 31 '13 at 20:02

So we can choose the first two numbers how we like. The third has to have a definite residue class mod $3$ to make the total divisible by $3$.

If the third residue class is distinct from the residue class the first two numbers, the first two have to be from different residue classes. The number of ways of choosing one from each residue class is $\binom {300}1 \times \binom {200}1 \times\binom {100}1$, but there are six different orders in which the same three numbers can be selected.

If the final residue class is the same as one of the previous ones, they all have to be the same. We choose one of the three residue classes, and there are then $\binom {100}3$ ways of choosing a triple.

So the overall number of ways is $$\frac 16\times\binom {300}1 \times \binom {200}1 \times\binom {100}1+3\times\binom {100}3$$

And this is equal to $$\binom {100}1 \times \binom {100}1 \times\binom {100}1+3\times\binom {100}3$$

Boris Novikov · Answer 2 · 2013-08-31T21:24:00.937

4

The remainders of these numbers must be only: $(0,0,0),(0,1,2),(1,1,1),(2,2,2)$. In every case you can chose ${100}\choose{3}$ triples. So you get $4\cdot {{100}\choose{3}}$ triples.

There is a mistake in my reasoning. See the remark of Douglas S. Stones below (thank to him).

edited Aug 31 '13 at 21:24

answered Aug 31 '13 at 20:01

Boris Novikov

17,470

3

In the $(0,1,2)$ case, we can choose $100^3$ triples. – Douglas S. Stones Aug 31 '13 at 20:14
Aside from the above, I found yours the best answer. Right to the point! – Douglas S. Stones Aug 31 '13 at 20:32
@Douglas S. Stones: Once more thank you. – Boris Novikov Aug 31 '13 at 20:38

score 2 · Answer 3 · answered Aug 31 '13 at 19:57

2

The combination of one number with remainder 1 and two numbers with remainder 2 gives a sum with remainder 2, so it is not a multiple of 3. You listed the possibilities for getting a sum that is a multiple of 3 correctly. At Thomas Andrews says, one of each group is the product of three ${100 \choose 1}$'s as you are choosing one from each group.

answered Aug 31 '13 at 19:57

Ross Millikan

374,822

So all possible ways are only those that are listed? – user2692669 Aug 31 '13 at 20:00
This answer is a good complement to Mark Bennet's answer. – user2692669 Aug 31 '13 at 20:16

score 1 · Answer 4 · answered Aug 31 '13 at 20:20

1

The number can be computed directly in GAP via:

Size(Filtered(Combinations([1..300],3),S->Sum(S) mod 3=0));

which returns 1485100. This matches $3\binom{100}{3}+100^3$.

answered Aug 31 '13 at 20:20

Douglas S. Stones

21,079

Is there a matlab equivalent? – user2692669 Aug 31 '13 at 20:25
I'd say the answer to that question is yes (but I don't know what it is). – Douglas S. Stones Aug 31 '13 at 20:26
1

@DouglasS.Stones: Thanks! BTW, using iterator of combinations is slightly faster and less memory expensive, since it does not require to create the list of all 4455100 combinations first. Try n:=0; for s in IteratorOfCombinations([1..300],3) do if Sum(s) mod 3 = 0 then n:=n+1; fi;od; n; – Olexandr Konovalov Sep 02 '13 at 12:05

In how many ways can three numbers be selected from the numbers $1,2,\dots,300$ such that their sum is divisible by $3$?

4 Answers4

Linked