Answer:
255 steps
Step-by-step explanation:
They give us the length of the bridge and the length of each step of Robert, therefore we must divide these values to find the number of steps necessary, but first we must pass the distance of the bridge to centimeters:
140m * 100cm / 1m = 14000
Therefore the bridge would have a length of 14000 centimeters, we divide:
14000/55 = 254.54
Which means that Robert take at least 255 steps to fully walk the bridge.
There are 10 letters in the set {a, b, c, d, e, f, g, h, i, j} which is the pool of letters to choose from when making these three letter codes.
We have 10 choices for slot 1
Then 9 choices for slot 2. This is because we can't reuse the choice for slot 1
Then 8 choices for slot 3
Overall, there are 10*9*8 = 90*8 = 720 different permutations
Answer: 720
Note: you can use the nPr permutation formula with n = 10 and r = 3 to get the same answer
Answer:5 N to the left
Step-by-step explanation:
Answer:
Assuming we're focusing on the shaded squares, 7/15
Step-by-step explanation:
There are 15 squares, and 7 are shaded
7/15
Answer & Step-by-step explanation:
So I can't exactly graph exactly, but I'll try...
To solve:
x+11<6 Subtract 11 on both sides.
x<-5
To graph:
<-------|---------o---------|-------->
-6 -5 -4
(The bolded part of the line is the side you shade the graph on. In case you can't see it, you have to shade the left side of the open circle.)
Hope this helps! Have an awesome day ( • ω • )^
