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
Answer:
no
Step-by-step explanation:
The x value of 5 is repeated making it not a function.
Answer:
-0.5879
......................................
Answer:
coach butler has $115.38 left
Step-by-step explanation:
you have to multiply 6 by 16.98 and 6 by 13.79 then you will get 184.62 then to get the remaining amount he has left you have to subtract 300-184.62 and so the answer would be 115.38
hope this helps and can you please mark me brainliest but you dont have to
Answer:
U'(12, 15)
Step-by-step explanation:
Given point U(4, 5) is part of figure STUVW that is dilated by a factor of 3 about the origin, you want the coordinates of U'.
<h3>Dilation</h3>
Dilation about the origin multiplies each coordinate value by the scale factor:
U' = 3U
U' = 3(4, 5) = (12, 15)
The coordinates of U' are (12, 15).
