0
Let S be a collection of 16 integers each from 1 to 30 inclusive show that there must exist two distinct elements in S which differ by exactly 3?
Wiki User
∙ 15y ago
'let s be a collection of 16 integers, each from 1 to 30 inclusive. show that there must exist two distinct elements in s which differ by exactly 3. 'let s be a collection of 16 integers, each from 1 to 30 inclusive. show that there must exist two distinct elements in s which differ by exactly 3.
Wiki User
∙ 15y ago
Add your answer:
Earn +20 pts
What does not represent the set of integers from 1 to 20?
Any set with fewer than or more than 20 distinct elements cannot represent the set of integers from 1 to 20.
What are distinct integers?
Integers are whole numbers, positive, negative or zero. Distinct merely means different.
What are distinct positive integers?
The set of positive integers is {1,2,3,4,5,...}. When referring to numbers, distinct simply means different from each other e.g. 2,6,7 and 9 are distinct positive integers but 2,6,6 and 9 are not distinct since two of them are equal.
Sum the integers from 1 to 100?
The sum of the integers from 1 to 100 inclusive is 5,050.
How many positive integers between 1000 and 9999 inclusive a are divisible by 9?
There are 1,000 positive integers between 1,000 and 9,999, inclusive, that are divisible by nine.
How many integers are there between -11 and 12?
There are 22 integers between them.
What is the sum of all integers from 1 to 20?
The sum of all integers from 1 to 20 inclusive is 210.
What is the sum from 1000 positive integers to 1100?
The sum of the positive integers from 1,000 to 1,100 inclusive is: 106,050
Is the set of integers between 1 and 100 inclusive?
To be pedantic, it is not.
What is the sum of the even integers from 2 to 100 inclusive?
2550
How many integers between 13 and 19 inclusive?
7
How many integers are between 0-10 inclusive?
10
