To solve this question, what you would need to do is add 30 to both sides of the equation and then divide by 9, to find the solution.
You can check if it is correct by substituting the same value back into the original equation and seeing if the left hand side is equal to the right hand side.
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:
That would be option C.
Step-by-step explanation:
I literally just took the quiz and got it right.
Answer:
Step-by-step explanation:
1. A
2. 6/10; 1/10
5's are in 10
6/10