Answer:
$26.91
Step-by-step explanation:
9.50 +13.93 =23.43
50.34 - 23.43 = 26.91
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:
32 divided by 4 = 8,
8^2 + 8^2 = 128
128: 11^2 = 121 close enough, 11 is your answer
We are finding hypotenuse but first we find the length of all sides of the two squares to find the two sides of the triangle then we find hypotenuse.
The product is -5x^2-27x-36
Answer:
6.becuase after the decimal or "." it goes 00.tenth, hundredth, thousandth, and so on
Step-by-step explanation:
PLEASE GIVE BRAINLIEST OR 5 ⭐