Answer:
-2.5
Step-by-step explanation:
-30 + (-15) + (-20) + 55 = -10. Then you divide it by how many numbers there are (4). Which equals - 2.5. If this is wrong, then round up to -3.
Answer:
(-7, -10)
Step-by-step explanation:
Solve for x and y in double variable equation
y = 2x + 4
y = x - 3
y = x - 3, plug in to first equation
x - 3 = 2x + 4
x = -7
y = -7 - 3
y = -10
(-7, -10)
Step-by-step explanation:
<h3><em>To</em><em> </em><em>write</em><em> </em><em>8</em><em> </em><em>more</em><em> </em><em>than</em><em> </em><em>follow</em><em> </em><em>this</em><em>:</em><em>-</em></h3><h3><em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em> </em><em>k</em><em>+</em><em>8</em></h3>
Answer:
See proof below
Step-by-step explanation:
An equivalence relation R satisfies
- Reflexivity: for all x on the underlying set in which R is defined, (x,x)∈R, or xRx.
- Symmetry: For all x,y, if xRy then yRx.
- Transitivity: For all x,y,z, If xRy and yRz then xRz.
Let's check these properties: Let x,y,z be bit strings of length three or more
The first 3 bits of x are, of course, the same 3 bits of x, hence xRx.
If xRy, then then the 1st, 2nd and 3rd bits of x are the 1st, 2nd and 3rd bits of y respectively. Then y agrees with x on its first third bits (by symmetry of equality), hence yRx.
If xRy and yRz, x agrees with y on its first 3 bits and y agrees with z in its first 3 bits. Therefore x agrees with z in its first 3 bits (by transitivity of equality), hence xRz.