1: m<ABD = m<CBE | given
2: m<CBD = m<CBD | reflexive
3: m<1 = m<3 | subtraction
The 16-ounce soft drink for $1.99 is better because it may be 40 cents more but it's also bigger :)
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
24/4: 24-12: 12+0: 12/1: 48/4: 72/6:
Answer:
293 miles
Step-by-step explanation:
284.58-17.95=266.63
266.63/0.91=293
293 miles