Is the statement ""For every natural number n ≥ 1 there exists a directed graph of n vertices for which every vertex has an inde
1 answer:
You might be interested in
Answer:
Step-by-step explanation:
Given
Solving (a): The mean
Mean is calculated as:
This gives:
Solving (b): The median
Sort the data in ascending order:
The median is:
The 8th item on the sorted dataset is 7; So:
Solving (c): The mode
Because it has a frequency of 3 (more than any other element of the dataset).
Answer:
If the minimum 13 chair were sold , then the minimum number of Table sold is 14
Step-by-step explanation:
Given as :
The cost of each chair = $ 200
The cost of each table = $ 600
The total number of furniture sold per day = 32
The minimum amount of selling per day = $ 12000
Let the total number of chair = C
The total number of table = T
So , according to question
C + T = 32 .......1
200 C + 600 T = 12000 .......2
Solving eq 1 and 2
200 C + 600 T = 12000
200 × ( C + T ) = 32 × 200
I.e 200 C + 200 T = 6400
or, ( 200 C + 600 T ) - ( 200 C + 200 T ) = 12,000 - 6400
Or, 400 T = 5600
∴ T =
I.e T = 14
Put The value of T in eq 2
So, 200 C + 600 × 14 = 12000
or , 200 C + 8400 = 12,000
Or, 200 C = 12000 - 8400
Or, 200 C = 3600
∴ C =
I.e C = 18
The number of chair sold is 18
If the number of chair sold is 13 ,
Then the min number of table sold = 200 × 18 + 600 T = 12000
i.e 600 T = 12000 - 3600
or, 600 T = 8400
∴ T =
I.e T = 14
Hence if the minimum 13 chair were sold , then the minimum number of Table sold is 14 . Answer