Answer:
The domain of the function will be {x I x ≠ 13}.
Step-by-step explanation:
The two functions f(x) and g(x) are given to be
f(x) = x + 7 and
Now, we have to find the composite function (fog)(x).
Here, (fog)(x) = f{g(x)}
⇒ 
Therefore, the denominator of the function can not be zero and the domain of the function will be {x I x ≠ 13}. (Answer)
Answer:
The value of x is 
hours.
Step-by-step explanation:
Machine A = 5 hours
Machine B = x hours
Machine A and B = 2 hours
Using the formula: 
where:
T is the time spend by both machine
A is the time spend by machine A
B is the time spend by machine B
Let multiply the entire problem by the common denominator (5B)
2x + 10 = 5x
Collect the like terms
10 = 5x - 2x
10 = 3x
3x = 10
Divide both side by the coefficient of x (3)
hours.
Therefore, Machine B will fill the same lot in hours.
Answer:
The standard deviation of that data set is 3.8
Step-by-step explanation:
The Empirical Rule states that, for a normally distributed random variable:
68% of the measures are within 1 standard deviation of the mean.
95% of the measures are within 2 standard deviation of the mean.
99.7% of the measures are within 3 standard deviations of the mean.
In this problem, we have that:
Mean = 55
95% of the data fall between 47.4 and 62.6. This means that 47.4 is 2 standard deviations below the mean and 62.6 is two standard deviations above the mean.
Using one of these points.
55 + 2sd = 62.6
2sd = 7.6
sd = 7.6/2
sd = 3.8
The standard deviation of that data set is 3.8
Answer:
$60 per ticket
Step-by-step explanation:
$215 is what it costs after the discount, so add the amount taken off, back on.
215+25
240
Then, divide by 4 to find the cost of each individual ticket.
240/4
60
Hope it helps!
<span>65 = number of different arrangements of 2 and 3 card pages such that the total number of card slots equals 18. 416,154,290,872,320,000 = number of different ways of arranging 18 cards on the above 65 different arrangements of page sizes. ===== This is a rather badly worded question in that some assumptions aren't mentioned. The assumptions being: 1. The card's are not interchangeable. So number of possible permutations of the 18 cards is 18!. 2. That all of the pages must be filled. Since the least common multiple of 2 and 3 is 6, that means that 2 pages of 3 cards can only be interchanged with 3 pages of 2 cards. So with that said, we have the following configurations. 6x3 card pages. Only 1 possible configuration. 4x3 cards and 3x2 cards. These pages can be arranged in 7!/4!3! = 35 different ways. 2x3 cards and 6x2 cards. These pages can be arranged in 8!/2!6! = 28 ways 9x2 card pages. These can only be arranged in 1 way. So the total number of possible pages and the orders in which that they can be arranged is 1+35+28+1 = 65 possible combinations. Now for each of those 65 possible ways of placing 2 and 3 card pages such that the total number of card spaces is 18 has to be multiplied by the number of possible ways to arrange 18 cards which is 18! = 6402373705728000. So the total amount of arranging those cards is 6402373705728000 * 65 = 416,154,290,872,320,000</span>
