(a) Given any set of seven integers, must there be at least two that have the same remainder when divided by 6? To answer this question, let A be the set of 7 distinct integers and let 8 be the set of all possible remainders that can be obtained when an integer divided by which means that 8 has 6 the integers in A to its remainder, then by the pigeonhole ✔principle, the function is not one-to-one. Therefore, for the set of integers in A, it is impossible question is yes (b) Given any set of seven integers, must there be at least two that have the same remainder when divided by 8? If the answer is yes, enter YES. If the answer is no, enter a set of seven integers, no two of which have the same remainder when divided by 8. ✔elements. Hence, if a function is constructed from A to B that relates eac for all the integers to have different remainders when divided by 6. So, the answer to the

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
(a) Given any set of seven integers, must there be at least two that have the same remainder when divided by 6?
✔ elements. Hence, if a function is constructed from A to B that relates each of
To answer this question, let A be the set of 7 distinct integers and let B be the set of all possible remainders that can be obtained when an integer is divided by 6, which means that B has 6
the integers in A to its remainder, then by the [pigeonhole
✔✔✔ principle, the function is not one-to-one ✔✔✔ . Therefore, for the set of integers in A, it is impossible ✔✔✔ for all the integers to have different remainders when divided by 6. So, the answer to the
question is yes
(b) Given any set of seven integers, must there be at least two that have the same remainder when divided by 8? If the answer is yes, enter YES. If the answer is no, enter a set of seven integers, no two of which have the same remainder when divided by 8.
X
Transcribed Image Text:(a) Given any set of seven integers, must there be at least two that have the same remainder when divided by 6? ✔ elements. Hence, if a function is constructed from A to B that relates each of To answer this question, let A be the set of 7 distinct integers and let B be the set of all possible remainders that can be obtained when an integer is divided by 6, which means that B has 6 the integers in A to its remainder, then by the [pigeonhole ✔✔✔ principle, the function is not one-to-one ✔✔✔ . Therefore, for the set of integers in A, it is impossible ✔✔✔ for all the integers to have different remainders when divided by 6. So, the answer to the question is yes (b) Given any set of seven integers, must there be at least two that have the same remainder when divided by 8? If the answer is yes, enter YES. If the answer is no, enter a set of seven integers, no two of which have the same remainder when divided by 8. X
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,