edited by
909 views
1 votes
1 votes
Let $a_1,a_2,a_3,....a_{100}$ and $b_1,b_2,b_3,....b_{100}$  be any two permutations of the integers from $1$ to $100$.

$a_1b_1,a_2b_2,a_3b_3,....,a_{100}b_{100}$

Prove that among the $100$ products given above there are two products whose difference is divisible by $100$.
edited by

1 Answer

Best answer
1 votes
1 votes

If among the products a1b1,a2b2,..........,a100b100 if we get two products aibi and ajbj such that the difference in between them is divisible by 100 then the remainders after dividing aibi and ajbj with 100 would be same.

Now, consider the numbers {0,1,2,......,99} as holes and the pigeons be the products {a1b1,a2b2,....,a100b100}

Now, we are putting the product aibi in the hole r if it leaves the remainder r when divided by 100.

If we get that a hole contains more than one product then we are done.

Assume that all the 100 holes contain one product (aibi ) each. 

Then there should be a product in hole 2 . Let the product be akbk.

Hence akbk = 100 q + 2. = (4 * 25) q + 2 = 4p + 2.

So, akbk leaves remainder 2 when divided by 4.

Now, since the holes contain one product each there are 50 products in the odd numbered holes.

Let the products in the odd numbered holes be albl . Then albl leaves odd remainder when divided by 100.

So, albl is an odd number and odd number is formed only when both al and bl are odd numbers.

Now, since albl is an odd number the remainder when divided by 4 can be either 1 or 3.

Now, the rest 50 products ahbh (say) are even and both ah and bh are even. So, the products ahbh are divisible by 4.

So, among the 100 products we are not getting any product which leaves remainder 2 when divided by 4.

But we know that akbk leaves remainder 2 when divided by 4. Hence contradiction.

So, the holes cannot contain 1 product each. So, there must be more than one products in at least one hole.

So, among the given products there must exists two products such that the difference between any two is divisible by 100.

selected by

Related questions

0 votes
0 votes
1 answer
1
aditi19 asked Oct 25, 2018
1,002 views
How many cards must be chosen from a standard deck of 52 cards to guarantee that there are at least two cards of each of two different kinds?what this question means?
1 votes
1 votes
1 answer
3
Sammohan Ganguly asked May 25, 2018
1,366 views
Suppose a graph $G$ has $6$ nodes. Prove that either $G$ or $G'$ must contain a triangle.($G'$ is the complement of $G$.) Prove it using pigeonhole principle.
4 votes
4 votes
2 answers
4
sourav. asked Aug 24, 2016
2,182 views
Show that if seven integers are selected from the first10 positive integers, there must be at least two pairsof these integers with the sum 11.Attempt-:partition will be ...