Answer:
-27
5
10
-13
Step-by-step explanation:
-9*3=-27 -*+=-
-25/-5=5 -/-=+
7-(-3)=7+3=10 -(-)=+
-2+-11=-13 -+-=-
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
Sqrt(15) would be irrational
Answer is B
Answer:
A. 7/11
Step-by-step explanation:
( f + g ) (x) = –2x + 6
( f – g ) (x) = 8x – 2
( f × g ) (x) = –15x2 + 2x + 8
<span>\mathbf{\color{purple}{ \left(\small{\dfrac{\mathit{f}}{\mathit{g}}}\right)(\mathit{x}) = \small{\dfrac{3\mathit{x} + 2}{4 - 5\mathit{x}}} }}<span><span>(<span><span>g</span><span>f</span><span></span></span>)</span>(x)=<span><span><span>4−5x</span></span><span><span>3x+2</span></span><span></span></span></span></span>