There are four numbers a , b , c and d , such that when they are each divided by 5, distinct nonzero remainders are obtained. Is it true that the sum of the numbers is not divisible by 5?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let a = 1 , b = 2 , c = 3 , b = 5 , the sum is 1 + 2 + 3 + 5 = 1 1 , which is not a multiple of 5.
Sometimes it is a multiple, sometimes not, generally it works in 5 1 of all cases; exactly when the numbers have remainders { 1 , 2 , 3 , 4 } but not for remainders { 0 , 1 , 2 , 3 } , { 0 , 1 , 2 , 4 } , { 0 , 1 , 3 , 4 } , { 0 , 2 , 3 , 4 } . You cannot say something general about the divisibility.
Problem Loading...
Note Loading...
Set Loading...
If a = 1 , b = 2 , c = 3 , d = 4 , then a + b + c + d = 1 0 which is a multiple of 5, so it sometimes is a multiple of five. Hence, the answer is no.