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


If f(x) = 3x-4 and g(x) = 4-3x then the solution of f(g(x)) = g(f(x)) proves that they are not inverse functions.
According to the question,
We have the following two functions:
f(x) = 3x-4 and g(x) = 4-3x
We know that in order to find whether two functions are inverse of each other or not we need to find the value of f(g(x)) and g(f(x)) and then see whether they are equal to x.
Now, among the given options, the only option representing this kind of solution is option D and the solutions are not equal which proves that they are not inverse functions.
Hence, the correct option is D.
To know more about inverse functions here
brainly.com/question/2541698
#SPJ1
Answer:
x= -1/3
y= -3 1/3
Step-by-step explanation:
Make both of them into y=Mx+b form
y=-x-3
y=(-x-7)/2
Substitute the x-3 in the first equation for the y in the second one.
x-3=(-x-7)/2
2x-6=-x-7
3x=-1
x=-1/3
Now that we have x, we can solve for y.
y=-x-3
y=-1/3-3
y=-3 1/3
The answer would be C if you factored out a 14.