<h3>
Answer: Choice A</h3>
Domain = (a,b]
Range = [mc + n,md + n)
==============================================
Explanation:
The domain stays the same because we still have to go through f(x) as our first hurdle in order to get g(x).
Think of it like having 2 doors. The first door is f(x) and the second is g(x). The fact g(x) is dependent on f(x) means that whatever input restrictions are on f, also apply on g as well. So going back to the "2 doors" example, we could have a problem like trying to move a piece of furniture through them and we'd have to be concerned about the f(x) door.
-------------------
The range will be different however. The smallest value in the range of f(x) is y = c as it is the left endpoint. So the smallest f(x) can be is c. This means the smallest g(x) can be is...
g(x) = m*f(x) + n
g(x) = m*c + n
All we're doing is replacing f with c.
So that means mc+n is the starting point of the range for g(x).
The ending point of the range is md+n for similar reasons. Instead of 'c', we're dealing with 'd' this time. The curved parenthesis says we don't actually include this value in the range. A square bracket means include that value.
The answer is 60. You can find this out by finding the least common multiple of 10 and 12, which is 60 because 10x6=60 and 12x5=60. Hope this helps :)
Hi,
16,500 rounded to the nearest ten thousand is 20,000.
Have a great day!
Answer:
Step-by-step explanation:
Let the integer be 6 for even and 7 for odd (say)
For 6, we divide by 2, now get 3. Now we multiply by 3 and add 1 to get 10. Now since 10 is even divide by 5, now multiply by 3 and add 1 to get 16. Now divide by 2 again by 2 again by 2 again by 2 till we get rid of even numbers.
The result is 1, so multiply by 3 and add 1 we get 4 now divide 2 times by 2 to get 1, thus this result now again repeats after 2 times.
Say if we select off number 3, multiply by 3 and add 1 to get 10 now divide by 5, now repeat the same process as above for 5 until we get 1 and it gets repeated every third time.
Thus whether odd or even after some processes, we get 1 and the process again and again returns to 1.
