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:
$13.38
Step-by-step explanation:
tax =7% x 12.50 = 7/100 x 12.5 = $0.875
Price to pay = $12.50 + $0.875 = $13.375 = $13.38
Reciprocal
Explanation:
I know what I know and this is one of those things
The pairs that are equivalent to each other are 40/1000 and 40%, 6/5 and 120%, 1/8 and 12.5% . They are the correct answers because if we divide for example 6/5 , we would get 1.2 and to turn a decimal into a percent we have to move the decimal point 2 times to the right meaning that the percentage would be 120% and you just do that for all! I hope this helped :)!!
Answer:
Theo worked for 12 hours and Kade worked for 15
Step-by-step explanation:
if kade worked for 10 hours Theo works for 7 so in total they worked for 17 hours together. So what you do is you just continue counting kades hours, subtracting 3 then add those number together till you get the total of 27 hours.