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
-2? it’s been awhile sorry if it’s wrong
270 miles be 90+90+90 equals 270 and thats the answer
Answer:

Step-by-step explanation:
Given the equation:

To find:
The solutions of given equation in the range [0, 2
) i.e. 0 can be in the answer but
can not be there in the answer.
Solution:
Taking
common, we get:

The solutions can be given as:
OR 
Let us solve both the equations one by one:
First equation:

Second equation:

Therefore, the answers as a comma separated list are:

Answer:
e) Hence 2, -7 are roots of the equation X² + 5X - 14 = 0
Step-by-step explanation:
given equation : X² + 5X - 14 = 0
⇒ X² + 7X - 2X - 14 = 0
⇒ X·(X + 7) - 2·(X + 7) = 0
⇒ (X + 7)·(X - 2) = 0
⇒ X = -7, X = 2
<u>Hence 2, -7 are roots of the equation X² + 5X - 14 = 0</u>