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:
24
Step-by-step explanation:
12 months in a year and Calvin gets 2 paychecks in one month
so 2 times 12 = 24 paycheck
No, because if he gets a paycheck every 2 weeks that would be about 4 paychecks in one month
so that would be about 48 paychecks in a year.
Answer:
1
Step-by-step explanation:
Answer:
Its F $1.75
Step-by-step explanation:
Because you add all the numbers up then once you get your answer you divided it by how many numbers there are like you'll get 8.75 divide it by 5 and you have your answer
Answer: 9 people are left at the party
Step-by-step explanation:
There was originally 8 females and 12 males
8-2 = 6
Twice the males as females
9 men leave which leaves 3 men and 6 women which is twice as many men
Hope this helps!
