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
x = 1.2226
EXPLANATION
To solve this equation we have to apply the property of the logarithm of the base,

Thus, we can apply the natural logarithm - whose base is e, to both sides of the equation,

Now we apply the property of the logarithm of a power,

In our equation,

Then divide both sides by 4 and solve,

The solution to this equation is x = 1.2226, rounded to four decimal places.
Answer:
I believe its A.
Step-by-step explanation:
Answer:
The width of the rectangle is 6cm.
Explanation:
Perimeter=2(length+width)
28=2(8+w)
Distribute 2 into the parentheses
28=16+2w
Combine like terms
28-16=2w
12=2w
Divide both sides by 2
6=w
I hope this helps! Please comment if you have any questions.