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:
2nd - (w - 5)(w + 5)
4th - (-4v - 9)(-4v + 9)
Step-by-step explanation:
1. The first option shows an expression multiplied by its opposite(x -1), so therefore, it does not show the difference of squares
2. The second option does show the difference of squares because it is in the form (a + b)(a - b)
3. The third option is just a square because the same expression is multiplied by itself.
4. The fourth option is the difference of squares because it is in the form (a + b)(a - b). a equals -4v and b equals 9 in this case.
5. The fifth option is not the difference of squares. No term in common in both expressions
6. The sixth option is just a square because the same expression is multiplied by itself.
In all, there are two options that are the difference of squares, the 2nd and 4th.
Answer: a). 5
Explanation:
5 > 4
7 , it’s x = 12 1/3, or in decimal form, 12.33. And at 8, it’s x = -6/11, or in decimal form, -0.54
Answer:
33 there you go
Step-by-step explanation: