edited by
660 views

1 Answer

0 votes
0 votes

Proof:

Let the integers be $\mathrm {\color {blue} {x_1, x_2, x_3,\cdots \cdots , x_{105}}}$

Assume the following sums:

$\mathrm {S_1 = x_1}$

$\mathrm {S_2 = x_1 + x_2}$

$\vdots \;\;\;= \;\;\; \vdots $

$\vdots \;\;\;= \;\;\; \vdots $

$\mathrm {S_k = x_1 + x_2+\cdots +x_k}$

Thus, in total we have $\mathrm {S_1, S_2, \cdots S_{105}}$ terms. Also, we know that in Modulo $99$, there can be only $99$ possible remainders.

This proves that there has to be some $\mathbf {i<j}$  where $\mathrm {S_i \equiv S_j (\text{mod} \;99)}$

$\therefore $ $99$ divides $\mathrm {S_j – S_i = x_{i+1} + x_{i+2}+...+x_j}$

Related questions

2 votes
2 votes
3 answers
1
go_editor asked May 29, 2016
680 views
Consider all possible permutations of eight distinct elements $a, b, c, d, e, f, g, h$. In how many of them, will $d$ appear before $b$? Note that $d$ and $b$ may not nec...
2 votes
2 votes
1 answer
2
1 votes
1 votes
1 answer
3
go_editor asked Jun 2, 2016
672 views
A group of $15$ boys plucked a total of $100$ apples. Prove that two of those boys plucked the same number of apples.
1 votes
1 votes
1 answer
4
go_editor asked May 27, 2016
552 views
There are $n$ students in a class. The students have formed $k$ committees. Each committee consists of more than half of the students. Show that there is at least one stu...