Justin rides 550 kilometers
or
justin rides 17 meter
Answer:
36,000 possible codes.
Step-by-step explanation:
I guess you want the total number of arrangements possible.
The first digit can be any number from 0 to 8. the middle numbers must each be any number from 0 to 9 and the last digit must be 2,4,6 or 8.
So the number of arrangements possible = 9 * 10 * 10 * 10 * 4
= 36,000.
Answer:
f(x) = |x + 1| – 3
Step-by-step explanation:
The given graph is a transformed absolute value function.
The parent function is

The graph is obtained by shifting, g(x) from the origin (0,0) to (-1,-3).
The transformed function is of the form:

Where (h,k) is the vertex.
We substitute h=-1 and k=-3 to get:

When we simplify we get:

|x-4| <3
=>. x-4<3 or -(x-4)<3
=>. x-4<3 or x+4>3
=>. x<7 or x>1
So solution is x>1 & x<7. =x€(1,7)
Hope it helps...
Regards,
Leukonov/Olegion.
You would use 6 = (0.08)w