Question

In: Advanced Math

20 pairwise distinct positive integers are all smaller than 70. Prove that among their pairwise differences...

20 pairwise distinct positive integers are all smaller than 70. Prove that among their pairwise differences there are at least 4 equal numbers

Solutions

Expert Solution

Notice that we have selected 20 pairwise distinct positive integers and all are smaller than 70.

As they are positive so greater than 0, and pairwise distinct means no two integers are same. Thus we can put these numbers in order.

So let the numbers be

.

Now observe that if in this list there are 5 consecutive numbers then we see that there consecutive difference would give us four 1s, for example, say 5,6,7,8,9 are in this list, then we have

6-5=7-6=8-7=9-8=1

that is, their pairwise differences are all 1.

So if such a list exists then we don’t have to prove anything.

This is for any number may be 2 or 3 or any other.

On the contrary let the list be such that their pairwise differences have at most 3 equal numbers.

Now let us form the differences

This consists of 19 numbers (differences) (pigeons).

Now if we add all these numbers we find

Since the largest possible number is 69 and the smallest possible number is 1, so

Further observe that at the least if 3 differences are each 1, 2, 3, 4, 5, 6 which counts for 18 differences and one difference being 7 then also we have

That is, in the minimum possible ay also the sum of the differences put in this order gives sum as 70 but this is >68 and hence our assumption is false that their pairwise differences have at most 3 equal numbers.

This proves that the list must contain 4 pairwise differences which are equal.

Kindly give a thumbs up


Related Solutions

Prove or disprove: If a, b, c are any three distinct positive integers such that 1/a...
Prove or disprove: If a, b, c are any three distinct positive integers such that 1/a + 1/b + 1/c = 1, then a + b + c is a prime
Prove or disprove: If a, b, c are any three distinct positive integers such that 1/a...
Prove or disprove: If a, b, c are any three distinct positive integers such that 1/a + 1/b + 1/c = 1, then a + b + c is a prime.
7. Let m be a fixed positive integer. (a) Prove that no two among the integers...
7. Let m be a fixed positive integer. (a) Prove that no two among the integers 0, 1, 2, . . . , m − 1 are congruent to each other modulo m. (b) Prove that every integer is congruent modulo m to one of 0, 1, 2, . . . , m − 1.
Prove that the following is true for all positive integers n: n is odd if and...
Prove that the following is true for all positive integers n: n is odd if and only if n2 is odd.
prove 2 is a factor of (n+1)(n+2) for all positive integers
prove 2 is a factor of (n+1)(n+2) for all positive integers
Consider all positive integers less than 100. Find the number of integers divisible by 3 or...
Consider all positive integers less than 100. Find the number of integers divisible by 3 or 5? Consider strings formed from the 26 English letters. How many strings are there of length 5? How many ways are there to arrange the letters `a',`b', `c', `d', and `e' such that `a' is not immediately followed by`e' (no repeats since it is an arrangement)?
How many different positive integers less than 1000 have distinct digits and are even? My attempt:...
How many different positive integers less than 1000 have distinct digits and are even? My attempt: since 1 digit numbers have the repeating 0 digit i started with 2 digit numbers. xxx= First digit: can only be 0 Second digit: can be any of 9 digits Third digit: can't be 0 or the digit used in the tens column so one of 4 numbers. 1*9*4= 36 ways so 1 * 9 * 4= 36 ways Now for the 3 digit...
Let A[1..n] be an array of distinct positive integers, and let t be a positive integer....
Let A[1..n] be an array of distinct positive integers, and let t be a positive integer. (a) Assuming that A is sorted, show that in O(n) time it can be decided if A contains two distinct elements x and y such that x + y = t. (b) Use part (a) to show that the following problem, re- ferred to as the 3-Sum problem, can be solved in O(n2) time: 3-Sum Given an array A[1..n] of distinct positive integers, and...
Use double induction to prove that (m+ 1)^n> mn for all positive integers m; n
Use double induction to prove that (m+ 1)^n> mn for all positive integers m; n
8.Let a and b be integers and d a positive integer. (a) Prove that if d...
8.Let a and b be integers and d a positive integer. (a) Prove that if d divides a and d divides b, then d divides both a + b and a − b. (b) Is the converse of the above true? If so, prove it. If not, give a specific example of a, b, d showing that the converse is false. 9. Let a, b, c, m, n be integers. Prove that if a divides each of b and c,...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT