Page 1 of 1
Narayanganj Higher Secondary 2014 P9
Posted: Mon Feb 18, 2019 7:58 pm
by samiul_samin
At least how many numbers are needed to be taken to be sure that there are at least $11$ numbers among these numbers where the difference between any two is divisible by $7$?
Re: Narayanganj Higher Secondary 2014 P9
Posted: Thu Oct 31, 2019 8:29 pm
by Ragib Farhat Hasan
At least $8$ numbers are needed to be taken to ensure that the difference between at least two numbers is divisible by $7$.
Now, if we take one more number, the difference between this and one of the "original" $8$ numbers is divisible by $7$.
Going on, we can see that at least $17$ numbers are required to be taken to ensure that there are at least $11$ numbers among them so that the difference between any two of those $11$ numbers is divisible by $7$.
Re: Narayanganj Higher Secondary 2014 P9
Posted: Thu Oct 31, 2019 8:30 pm
by Ragib Farhat Hasan
There is a much more formal solution to this problem using Modular Arithmetic.
But I'm too lazy to type that long a solution!