Partition the set A into 4 subsets:
{1, 8}, {2, 7}, {3, 6}, and {4, 5},
each consisting of two integers whose sum is 9. If 5 integers are selected from A,
then by the Pigeonhole Principle at least two must be from the same subset. But
then the sum of these two integers is 9.
You can build as many numbers as you like: just pick three primes and repeat them as required.
The only caution is that you have to pick large enough primes to make sure that the result is larger than 1000.
Since
, it is enough that the prime repeating three times is larger than 10.
So, for example, we can pick
- 2, not repeating
- 3, repeating twice
- 11, repeating 3 times
The result is

Any fraction with a denominator of 8 and
a numerator less than 6.66 does the job.
Answer:
A, because its reflecting off of the y axis
Step-by-step explanation:
I have proof links, and I took the test
Answer: -8/5
Step-by-step explanation:
I know this because -1 2/5 is -7/5 and 1 1/7 is 8/7. Multiply the numerator and denominator together and you get the answer