Answer:
I don't know but this question feels incomplete
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.
Answer:
Step-by-step explanation:
A) 5x = 3(x - 2.5)
-----------------------
B)
Distribute
5x = 3x - 7.5
Subtract 3x from both sides
2x = -7.5
Divde both sides by 2
x = -3.75
-----------------------
C)
5 * (-3.75) = 3(-3.75 - 2.5)
-18.75 = -18.75
D)
Tanya paid –$3.75 for each of 5 items
Tony paid –$6.25 for each of 3 items
There seems to be an error in the question since the cost of items is negative
Tony bought fewer items and paid less for each.
