Question
. Show that for any given 52 integers there exist two of them whose sum, or else whose difference, is divisible by 100 .
Step 1
First, consider the remainders when each of the 52 integers is divided by 100. There are 100 possible remainders: 0, 1, 2, ..., 99. Show more…
Show all steps
Your feedback will help us improve your experience
Akash Goyal and 75 other Precalculus educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Given a set of 52 distinct integers, show that there must be 2 whose sum or difference is divisible by 100.
Find the sum of integers from 1 to 100 which are divisible by 2 or 5 .
The sum of integers from 1 to 100 that are divisible by 2 or 5 is
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD