The answer to this problem is A
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:
(x+10)(x+1)( x-3) ( x-3)
Step-by-step explanation:
root of 3 with multiplicity 2
( x-3) ^2 or ( x-3) ( x-3)
root of -10
(x- -10) is (x+10)
root of -1
(x - -1) is (x+1)
( x-3) ^2 (x+10)(x+1)
Since it is 10 less and you are trying to find out your number, you add 10.
71+10= 81
So, your number is 81.
Answer:
idk
Step-by-step explanation: