a. The moduli are coprime, so you can apply the Chinese remainder theorem directly. Let
- Taken mod 3, the last two terms vanish, and
so we need to multiply by the inverse of 2 modulo 3 to end up with a remainder of 1. Since 
, we multiply the first term by 2.
- Taken mod 4, the first and last terms vanish, and
. Multiply by the inverse of 3 modulo 4 (which is 3 because 
), then by 2 to ensure the proper remainder is left.
- Taken mod 5, the first two terms vanish, and
. Multiply by the inverse of 2 modulo 5 (3, since 
) and again by 3.
By the CRT, we have
i.e. any number 
(where 
is an integer) satisifes the system.
b. The moduli are not coprime, so we need to check for possible contradictions. If 
and 
, then we need to have 
. This basically amounts to checking that if , then we should also have 
.
The last congruence conflicts with the previous one modulo 3, so there is no solution to this system.
Steps:
37-(x+8)=32
Subtract 37 from both sides
37-(x+8)-37=32-37
Simplify
-(x+8)=-5
Divide both sides by -1
-(x+8)/-1=-5/-1
Simplify
x+8=5
Subtract 8 from both sides
x+8-8=5-8
Simplify
x=-3
Answer:
C=25 (vertically opposite angle)
b=150 (linear pair)
d=150(vertically opposite angle)
Step-by-step explanation:
pls mark BRAINLIEST
Answer:
Step-by-step explanation:
250 is the answer from a high schooler
Answer:
8/16
Step-by-step explanation:
(8÷8)=1 / (16÷8)=2 = 1/2
