For this problem,we use the Fundamental Counting Principle. You know that there are 7 digits in a number. In this principle, you have to multiply the possible numbers for every digit. If the first number cannot be zero, then there are 9 possible numbers. So, the value for the first digit is 9. The second digit could be any number but less of 1 because it was used in the 1st digit. So, that would be 10 - 1 = 9. The third digit must be the value in the second digit less than 1. That would be 9 - 1 = 8. And so on and so forth. The solution would be:
9×9×8×7×6×5×4 = 544,320 7-digit numbers
Answer:
y=1/2x+2(2 is the y-intercept)
The blue line and black line have the same y-intercept, but the black line has a slope 1/6 greater than the blue line.
Hope it helps <3
Answer:
12
Step-by-step explanation:
The median is the one in the middle. For an <u>odd</u> number of seats, average the first and last seat numbers.
(1 + 23) / 2 = 24 / 2 = 12. That means there will be 11 people on your left and 11 people on your right.
For an even number of seats, the same method doesn't work as well! If there are 14 seats, for example, (1 + 14) / 2 = 15 / 2 = 7.5, and if you sit in "seat" 7 and a half, it will be awkward!
Answer:
Step-by-step explanation:
Given
See attachment for proper format of table
--- Sample
A = Supplier 1
B = Conforms to specification
Solving (a): P(A)
Here, we only consider data in sample 1 row.
In this row:
and 
So, we have:
P(A) is then calculated as:
Solving (b): P(B)
Here, we only consider data in the Yes column.
In this column:
and 
So, we have:
P(B) is then calculated as:
Solving (c): P(A n B)
Here, we only consider the similar cell in the yes column and sample 1 row.
This cell is: [Supplier 1][Yes]
And it is represented with; n(A n B)
So, we have:
The probability is then calculated as:
Solving (d): P(A u B)
This is calculated as:
This gives:
Take LCM
Answer:
I think it's the third one
Step-by-step explanation:
I've done this before, but try the 3rd one, if not then try the second one. it's been awhile since I've done this. I'm sorry if I'm wrong
