The answer is 8.33333333333333333...
Answer:
g(f(0)) = 2
Step-by-step explanation:
To find g(f(0)), you must first find f(0).
f(x) = 3x + 1
f(0) = 3(0) + 1 = 0 + 1 = 1
Now you input 1 into function g(x).
g(x) = (4x + 2)/3
g(1) = [4(1) + 2]/3
g(1) = [4 + 2]/3
g(1) = 6/3
g(1) = 2
g(f(0)) = 2
Adrian can put a total of 1716 combinations in the player.
The formula to be used is as follows:
total combinations = n!/[r! *(n-r)!]
n = number of disks available = 13
r = number of disks that be held = 6
= 13! = (13• 12•11•10•9•8•7•6•5•4•3•2•1)/(6! <span>• 7!)
</span>=1716
Thank you for posting your question. Feel free to ask me more.
That would be D
the first 3 = -12x + 24
bur D = -12x - 24
