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:
Swimming one time around the pool is 56.5 ft
Step-by-step explanation:
Swimming 18 ft from one side of her circular pool to the other, swimming straight through the center means the circular swimming pool has a diameter of d=18 ft.
The circumference of the circle is calculated using:
where d=18 is the diameter and π=3.14 as given.
We substitute the values to get:
We approximate to the nearest tenth to get:
Answer:
x-intercept(s) = (-2,0)
y-intercept(s) = (0, - 5/2)
Step-by-step explanation:
the x-intercept, substitute in 0 for y and solve for x
. To find the y-intercept, substitute in 0 for x and solve for y
.
x-intercept(s) = (-2,0)
y-intercept(s) = (0, - 5/2)
