Answer:
A. x + 9
Step-by-step explanation:
x² + 5x - 36 = (x + 9) (x - 4)
Kory and Leanne will meet each other again after 36 minutes from starting i.e. at 10:36 am .
<u>Step-by-step explanation:</u>
Here we have , Leanne runs a lap in 12 minutes. Kory runs a lap in 9 minutes. We need to find out that If they both start running at 10 am, at what time will they both cross the start together again . Let's find out:
Kory runs a lap in 9 minutes and , Leanne in 12 minutes , in order to find at what time will they both cross the start together again we will find LCM of 9 & 12 :
⇒ 
⇒ 
So ,LCM of 9 & 12 is 36 .That means Kory and Leanne will meet each other again after 36 minutes from starting i.e. at 10:36 am .
In clear way , Kory will run race as :
1st lap = 9 minutes
2nd lap = 18 minutes
3rd lap = 27 minutes
4th lap = 36 minutes , i.e. at 10:36 am he'll complete his 4th lap
For , Leanne
1st lap = 12 minutes
2nd lap = 24 minutes
3rd lap = 36 minutes i.e. at 10:36 am he'll complete his 3rd lap .
This means Kory & Leanne will meet at 10:36 am completing there 4th and 3rd lap respectively .
Answer:
The value of 4 is an input of the function
Step-by-step explanation:
Define the variables
Let
x ----> the independent variable or input value
y ----> the dependent variable or output value
Looking at the graph
The domain of the graph (all possible values of x) is equal to the interval
[1,∞)

All real numbers greater than or equal to 1
The range of the function (all possible values of y) is equal to the interval
(-∞,3]

All real numbers less than or equal to 3
therefore
The value of 4 is an input of the function
Answer: 
Step-by-step explanation:
Given : Number of choices for novels = 4
Number of choices for plays = 6
Number of choices for poetry books = 5
Number of choices for nonfiction books = 5
Total books =4+6+5+5=20
If he wants to include all 4 novels, then the number of books left to select = 9-4=5
Remaining choices for books = 20-4=16
Number of combinations of n things taking r at a time : 
Then, the number of different reading schedules are possible :_

Hence, the required answer is
.