X-5) = 2(x-1)
3x-15 = 2x - 2
x - 15 = -2
x = 13
Answer: A union B = B
The first one should’ve said A intersects B = A because the entirety of A exists in B
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.
Answer:
A, B and C
Step-by-step explanation:
A) 3 and 18 = has 3 as factor
B) 8 and 24 = has 3 as factor
C) 12 and 18 = has 3 as factor
D) 1 and 3 = has as factor of 1 and 3
so the answer is A, B and C
Answer:
7/100
Step-by-step explanation:
Find the GCD (or HCF) of numerator and denominator
GCD of 70 and 100 is 10
Divide both the numerator and denominator by the GCD
70 ÷ 10
100 ÷ 10
Reduced fraction:
7
10
Therefore, 70/100 simplified to lowest terms is 7/10.
