Answer:
<u>Residue</u>
Step-by-step explanation:
Let a and b be integers. We define a mod b to be the residue of dividing a by b. For example, if a evenly divides b, then a mod b=0, 20 mod 6= 2. The modulus operator is widely used in programming, and it is convenient when a and b are large numbers.
a mod b is always a nonnegative integer. In fact, 0≤ a mod b≤ |b-1| by the division algorithm. a and b can also be negative integers. Since 8=-(-5)+3 then 8 mod -5= 3.
As a final example, some known properties can be rewritten in terms of mod. a mod 2=0 if and only if a is even. a mod 2=1 if and only if a is odd.
15-b=4b-5(5-3)
Multiply the bracket by -5
(-5)(5)=-25
(-5)(-3)=15
15-b=4b-25+15
15-b=4b-10
Move 15 to the other side
Sign changes from +15 to -15
15-15-b=4b-10-15
-b=4b-25
Move 4b to the other side.
-b-4b=4b-4b-25
-b-4b=-25
-5b=-25
divide both sides by -5
-5b/-5=-25/-5
Answer: b=5
Answer:
The first and third options are parallel.
Step-by-step explanation:
They both have a slope of 2.
Pls mark brainliest. Thanks!
