Consider a set of m distinct positive integers. What’s the largest integer, d,
that when divided into the m integers is guaranteed to produce at least one
pair of results with the same remainder? Explain.
11-14-2006 10:56 AM
#1
| |
| |
11-14-2006 11:05 AM
#2
| |
d= m - 1? i think that makes sense | |
11-14-2006 11:23 AM
#3
| |
Do your own homework. | |
| |
11-14-2006 11:35 AM
#4
| |
studying, not hw | |
11-14-2006 11:41 AM
#5
| |
![]() ![]()
|
you forgot to explain your answer though |
| |
11-14-2006 11:46 AM
#6
| |
"Ooooh, a sarcasm detector. Oh thats a REAl useful invention." - Comic book guy. | |
11-14-2006 11:47 AM
#7
| |
Do you mean your set of numbers run from 1,2,3,..,m-1,m? Because the way you phrased it m sounds like the number of integers in your set. | |
11-14-2006 12:04 PM
#8
| |
The range of possible remainders go from 0 to d-1 (remainder can't be equal or bigger than d else the quotient would be 1 more). So if we want a remainder to appear more than once we would need to have more numbers than the possible number of remainders. Since the range of possible remainders (0 to d-1) contains d numbers we need to have d+1 numbers. So if our set of numbers goes from 1..m we have m numbers and d=m-1, if our set of numbers go from 0..m we have m+1 numbers and d=m. | |
11-14-2006 12:11 PM
#9
| |
theres the reasoning alright....i knew you were good for something arkana | |
11-14-2006 12:16 PM
#10
| |
"Hey, what did you get for number 6?" | |
| |
11-14-2006 12:18 PM
#11
| |
42. | |
11-14-2006 12:42 PM
#12
| |
| |
11-14-2006 12:49 PM
#13
| |
| |
11-14-2006 01:02 PM
#14
| |
| |
| |
11-14-2006 01:22 PM
#15
| |
| |
11-14-2006 01:29 PM
#16
| |
| |
| |
11-14-2006 01:54 PM
#17
| |
| |
11-14-2006 01:55 PM
#18
| |
| |
| |
11-14-2006 01:58 PM
#19
| |
| |
11-14-2006 02:04 PM
#20
| |
6' by 9' = 54 sq/ft | |
11-14-2006 02:11 PM
#21
| |
seriously gabe, you're studying when you could be ballin' at 25/50 with hal or building sweaters. I'm disappointed in you. | |
11-14-2006 02:27 PM
#22
| |
| |
| |
11-14-2006 03:26 PM
#23
| |
| |
11-14-2006 04:50 PM
#24
| |
| |
| |
11-15-2006 05:52 AM
#25
| |
| |