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:
как работать с ю так 87
Step-by-step explanation:
156
|x| = x for x ≥ 0
examples:
|3| = 3; |0.56| = 0.56; |102| = 102
|x| = -x for x < 0
examples:
|-3| = -(-3) = 3; |-0.56| = -(-0.56) = 0.56; |-102| = 102
--------------------------------------------------------------------------------
Use PEMDAS:
P Parentheses first
E Exponents (ie Powers and Square Roots, etc.)
MD Multiplication and Division (left-to-right)
AS Addition and Subtraction (left-to-right)
--------------------------------------------------------------------------------

Put the values of x to the equation of the function h(x):

Answer:
0.972222 yards
Step-by-step explanation:
35/36= 0.972222
Find the least common denominator for each of these fractions then complete the equation until it equals 1.
Common factor is 30
u/5 = 6u/30
u/10 = 3u/30
-u/6 = -5u/30
6u/30 + 3u/30 - 5u/30 = 1
4u/30 = 1
4u = 30
u = 7.5