Answer:
3x + 2
Step-by-step explanation:
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
So bassically
his commision rate is
x% times 190000=comission
so x% times 190000=11400
divide both sdies by 190000
x%=11400/190000
solve for x percent
11400/190000=114/1900=3/50
x%=3/50
percent means parts out of 100 so x%=x/100
x/100=3/50
3/50=6/100
x/100=6/100
multiply both sdies by 100
x=6
the commision rate is 6%
Irrational roots occurs with its conjugate.
Therefore, -√3 is also root of the function.
The answer is -√3.
To solve this problem you must apply the proccedure shown below:
1. Let's round the value to the nearest hundredth. As you can see, the digit 8 is in the thousandths place and is greater than 5, therefore, you must round up to 0.038.
2. Now express the value as a single digit times a power of 10, as following:
x
Therefore, the answer is:
x