Answer:
1/4
Step-by-step explanation:
To find the roots of the expression, factor the expression by GCF.
The roots are the factors set equal to 0 and solved for x.
2x = 0
x=0
4x-1 = 0
x = 1/4
The sum is the addition of the two roots 0 + 1/4 = 1/4
This is an excellent practice on the law of inclusion/exclusion.
For example, using | | to represent cardinality (i.e. count in the set)
|A∪B∪C|=|A|+|B|+|C|-|A∩B|-|B∩C|-|C∩A|+|A∩B∩C|.
I am not allowed to provide a link, but if you could use some additional reading, google "wiki Inclusion–exclusion_principle" and the first wiki entry should explain that in more detail.
Here we have
A=the set of 15bit numbers starting with 101xxxx...
B=the set of 15bit numbers starting with xx1010xxxx...
C=the set of 15bit numbers ending with xxxxxxxxxxx1001
A∩B=101010xxxxx
B∩C=101xxxxx...xxx1001
C∩A=xx1010xx...xxx1001
A∩B∩C=101010xxxxx1001
Therefore
|A|=2^12 (there are 12 bits left)
|B|=2^11 (there are 11 bits left)
|C|=2^11 (there are 11 bits left)
|A∩B|=2^9 (9 bits left)
|B∩C|=2^8 (8 bits left)
|C∩A|=2^7 (7 bits left)
|A∩B∩C|=2^5 (5 bits left)
Applying the inclusion/exclusion principle,
|A∪B∪C|
=|A|+|B|+|C|-|A∩B|-|B∩C|-|C∩A|+|A∩B∩C|
=2^12+2^11+2^11-2^9-2^8-2^7+2^5
=7328
Answer:
in the thousandths
Step-by-step explanation:
because it would go
hundreds,tens,ones (decimal) tenths, hundredths,then thousandths
Answer:
M(4, 3 )
Step-by-step explanation:
Given endpoints (x₁, y₁ ) and (x₂, y₂ ) then the midpoint is
( , )
Here (x₁, y₁ ) = A(7, 4) and (x₂, y₂ ) = B(1, 2) , thus
M = (, ) = ( , ) = (4, 3 )
Answer: B
Because it does not pass through (0,0)