Answer:
1. 336
2. 162
3. 130
4. 93.5
5. 108
6. x = 2
7. x = 2
8. x = 4
9. h = 10
Step-by-step explanation:
Hope this helped, sorry if any are wrong
Answer : H-2
I can sure that's the answer
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:
1/12
Step-by-step explanation:
multiple of 3 and a multiple of 4 implies it can only be 12.
Since you only have the numbers from 1 to 12,
the prob(the 12) = 1/12
Answer:
65 would be C
Step-by-step explanation:
it wants you to find out how much was spent after 11 visits. 10 dollars is used each time so 11 times 10 is 110. 306 minus 110 equals 196. you would choose C instead of B because the 10 is the one being multiplied, not 306.
306-10x; $196