Answer:
101 is your answer
Step-by-step explanation:
Remember to follow PEMDAS & the left->right rule.
First, multiply 12 with 13:
12 x 13 = 156
Next, divide 156 with 2
156/2 = 78
Finally, add 23
78 + 23 = 101
101 is your answer
~
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:
-24
Step-by-step explanation:
I´m guessing by the big x sign you want me to multiply so the first step in the equation is to multiply because of PEMDAS so(6*2)+(8*-3)-3*2-6,
so 6*2=12,8*-3=-24,-3*2=-6
12+-24-6-6,
12-24=-12,-6+-6=-12
-12+-12=-24
Answer:
The formatting on this is a little weird but if I'm reading it correctly:
1) 3.38
2) 7.29
3) 0.05
4) 0.42
D ~ Positive Exponetial growth. Hope it helped!!! <3 (^u^)