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
the
first equation is the answer of this question.
explanation
where the xy is in sequence so it is the standard form of polynomial
Answer:
its b
Step-by-step explanation:
got it right on edge
Answer:
286 i think
Step-by-step explanation:
hope this helps
Answer:
False.
Step-by-step explanation:
The answer is NOT 6 1/2 loaves it is 6 loaves.
Knowing that there Max has 5 1/4 cups of raisins and each loaf requires 7/8 cup of raisins, we would need to divide.
Let's turn the 5 1/4 into an improper fraction so when we divide the two fractions, it would be easier!
<u>To turn 5 1/4 into an improper fraction we need to...</u>
5 x 4 = 20
20 + 1
21/4
Now we divided 21/4 by 7/8.
When dividing fractions remember the rule: KEEP CHANGE FLIP!
We keep the first fraction...which is 21/4 in this case
Change the sign from division to multiplication
21/4 x 7/8
And flip 7/8 so it becomes 8/7
21/4 x 8/7
= 168/28
= 6 loaves
So, the answer is not 6 1/2 loaves (false!)