Answer:
im on the same question and i dont know
Answer:
680
Step-by-step explanation:
Use the binomial coefficient where you choose 
numbers out of 
possible numbers and find the total amount of combinations since order does not matter:
Thus, you can make 680 three-non-repeating-number codes
I think 8. Plug in -4 for x. 1/2-4^2
Using pemdas -4^2 is 16 and 1/2•16 is 8. If there were parenthesis around 1/2x then 1/2•-4 would be -2 and -2^2 is 4 but since there aren’t parentheses then 8
answer A
Step-by-step explanation:
answer A
as g(0)=1/4
for the other cases g(0) = -1, 3 or 4 so this is not possible
