Two questions: We select 38 even positive integers all less than 1000. Prove tha

Question

Two questions:
We select 38 even positive integers all less than 1000. Prove that there will be two of them whose differenc is at most 26.
Explain how every decimal integer has a binary representation and that representation is unique. Two questions:
We select 38 even positive integers all less than 1000. Prove that there will be two of them whose differenc is at most 26.
Explain how every decimal integer has a binary representation and that representation is unique.
We select 38 even positive integers all less than 1000. Prove that there will be two of them whose differenc is at most 26.
Explain how every decimal integer has a binary representation and that representation is unique.

Explanation / Answer

1. let the combination of two numbers whose difference is 26:

with most least range

{2,...,28}, {30, ...., 56}, {58, ...., 84} ...............

hence we can say that there will be two of them whose difference is at most 26.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.