What is the least amount of integers you must pick in order to be sure that at least two of them have the same remainder when di
1 answer:
There are exactly 15 remainders modulo 15 and they are 0,1,2,…,14.
It is given that at least two of them should have the same remainder when divided by 15.
Division algorithm.
Let aa be an integer and d a positive integer. Then there are unique integers q and r with such that
q is called the quotient and r is called the remainder
q=a div d
r=a mod d
Pigeonhole principle If k is a positive integer and k+1or more objects are placed into k boxes, then there is at least one box containing two or more objects.
Hence, there are exactly 15 remainders modulo 15 and they are 0,1,2,…,14.
Learn more about integers here: brainly.com/question/20521181
#SPJ4
You might be interested in
You reject the Null Hypothesis when you have a small P-Value. Here is an example! Also we never accept the null hypothesis, think of it like this if we bring someone to court you wouldn't say their innocent of a crime, you only know that if they do not get convicted of the crime they are not guilty in the eyes of the law. Same thing applies here, since there could be several answers that satisfy our assumptions made, we can not be certain that 1 of those assumptions is the REAL answer it's just AN answer.
