Answer:
0
Step-by-step explanation:
=-5/6-7/6+2
=-12/6+2
=-2+2=0
QUESTION:
The code for a lock consists of 5 digits (0-9). The last number cannot be 0 or 1. How many different codes are possible.
ANSWER:
Since in this particular scenario, the order of the numbers matter, we can use the Permutation Formula:–
- P(n,r) = n!/(n−r)! where n is the number of numbers in the set and r is the subset.
Since there are 10 digits to choose from, we can assume that n = 10.
Similarly, since there are 5 numbers that need to be chosen out of the ten, we can assume that r = 5.
Now, plug these values into the formula and solve:
= 10!(10−5)!
= 10!5!
= 10⋅9⋅8⋅7⋅6
= 30240.
Answer:
3
Step-by-step explanation:
find the lowest common multiple of 2, 3, and 5.
That is 30.
So every 30th burger will have all 3 condiments.
100/30 = 3 and 10 left over.
We only care about the 3
Answer:
f(1)=4
f(-3)=4
f(5)=-2
f(0)=2
f(-1)=0
f(3)=2
Step-by-step explanation:
Pose f(x) as your x value. Now apply to the graph
The distance of the plane flies between the two cities is 1,113.75 miles
The formula for calculating the distance travelled is expressed as:
D = vt where:
v is the speed
t is the time taken
Given the following:
v = 99mi/hr
Total time taken = 5hr + 6.25hr
Total time taken = 11.25hr
Get the required distance
Distance = 99mi/hr * 11.25hr
Distance = 1,113.75miles
Hence the distance of the plane flies between the two cities is 1,113.75 miles
learn more here: brainly.com/question/7245260
