Hmmmm well I would first round the 1 and make it a 0 round the 9 and add to 6 and round 7 (was originally 6) to add 1 to 25 and then round 26 to 30
The way to determine the number of solutions is to complete the problem in multiple different ways.
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:
Don't quote me on this but it's probably C. 12c ≥ 88
Step-by-step explanation:
This is because he packages 88 eggs <em>into </em>cartons of 12.
88/12 is 7.33333... so it makes sense to have a greater or equal amount of eggs. If you multiply 7.333333... by 12, each additional 3 gets you closer to 88 so again, makes sense to have more.