4, 5, and 7 are mutually coprime, so you can use the Chinese remainder theorem right away.
We construct a number
such that taking it mod 4, 5, and 7 leaves the desired remainders:

- Taken mod 4, the last two terms vanish and we have

so we multiply the first term by 3.
- Taken mod 5, the first and last terms vanish and we have

so we multiply the second term by 2.
- Taken mod 7, the first two terms vanish and we have

so we multiply the last term by 7.
Now,

By the CRT, the system of congruences has a general solution

or all integers
,
, the least (and positive) of which is 27.
Answer:
4x^{14}
Step-by-step explanation:
in that equation, when you multiply integers with exponents, the integers multiply but the exponents add.
2+3+9 = 14
which means that the awnser is 4x^{14}
Answer:
C) 35
Step-by-step explanation:

Answer:
1 line is determined by 2 points.
Step-by-step explanation: