LFT says that for any prime modulus

and any integer

, we have

From this we immediately know that

Now we apply the Euclidean algorithm. Outlining one step at a time, we have in the first case

, so

Next,

, so

Next,

, so

Finally,

, so

We do the same thing for the remaining two cases:


Now recall the Chinese remainder theorem, which says if

and

, with

relatively prime, then

, where

denotes

.
For this problem, the CRT is saying that, since

and

, it follows that



And since

, we also have


Answer:
Slope: 2
Y-intercept: -4
Step-by-step explanation:
Slope = y2 - y1 / x2 - x1
Slope = -2 - -4 / 1 - 0
Slope = 2 / 1
Slope = 2
Y-intercept is when x = 0
This is shown on the first row
When x = 0, y = -4, which is our y-intercept
Answer:
x = 2
Step-by-step explanation:
Given
5x - 4 = - 3x + 12 ( add 3x to both sides )
8x - 4 = 12 ( add 4 to both sides )
8x = 16 ( divide both sides by 8 )
x = 2
Answer:
w = -12
Step-by-step explanation:
Answer:
Solve for
x
by simplifying both sides of the equation, then isolating the variable.
Step-by-step explanation:
is this solve for x? you can just tell me what you are doing with this ex: adding, etc