This is a simple problem based on combinatorics which can be easily tackled by using inclusion-exclusion principle.
We are asked to find number of positive integers less than 1,000,000 that are not divisible by 6 or 4.
let n be the number of positive integers.
∴ 1≤n≤999,999
Let c₁ be the set of numbers divisible by 6 and c₂ be the set of numbers divisible by 4.
Let N(c₁) be the number of elements in set c₁ and N(c₂) be the number of elements in set c₂.
∴N(c₁) =

N(c₂) =

∴N(c₁c₂) =

∴ Number of positive integers that are not divisible by 4 or 6,
N(c₁`c₂`) = 999,999 - (166666+250000) + 41667 = 625000
Therefore, 625000 integers are not divisible by 6 or 4
Answer:
C. X = 1/2
Step-by-step explanation:
4x - 3 + 5 = 2x + 7 - 8x
4x +2 = - 6x + 7
4x + 6x = 7 - 2
10x = 5
x = 1/2
Answer:
0.5613
Step-by-step explanation:
Here mean strain of bacteria x = sum of all numbers/ total numbers = 0.5514 %
Standard deviation s = 0.0040 %
Test statistic
G = (x_{max} -x)/s = (0.5613 - 0.5514)/ 0.0040 = 2.475
95% confidence value for outlier for n = 8 and alpha = 0.05
G_{critical} = 2.1266
so here we see that G > G_critical , so we reject that the there is no outlier . the value of 0.5613 is and outlier.
Answer:
There are no specified Numbers provided
Step-by-step explanation:
The believe the answer is m=9.