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.
Answer:
9>a
Step-by-step explanation:
The greater than symbol is >
The less than symbol is <
It can be helpful to imagine the signs as little crocodile mouths. They will turn their heads to the biggest catch, or in this case, the greater number. So the open end of the sign will be towards the greater number.
Answer:
D is your answer
Step-by-step explanation:
-1/2ac^2 flip to make it positive which makes it a whole number = 2ac^2
Answer:
Yes, it is a function
Step-by-step explanation:
Every possible input x value is paired with a unique output y value.
Another approach is to graph the function then conduct the VLT (vertical line test) at which point you will realize that any vertical line will intersect the graph at one point only meaning it is a function.
Hope this helps.
