Prove that from any set A which contains 138 distinct integers, there exists a subset B which contains at least 3 distinct integers and the sum of the elements in B is divisible by 46. Show all your steps
We apply pigeonhole principal to solve this question. See the
attached image for the detailed solution.
Get Answers For Free
Most questions answered within 1 hours.