Y’all need to stop doing links!
y’all can get banned.... so yeah okay 623
I can't solve it because it didn't have enough information
First solve the congruence
. Euclid's algorithm shows
330 = 25 * 13 + 5
13 = 2 * 5 + 3
5 = 1 * 3 + 2
3 = 1 * 2 + 1
=> 1 = 127 * 13 - 5 * 330
=> 127 * 13 = 1 mod 330
so that
is the inverse of 13 modulo 330. Then in the original congruence, multiplying both sides by 127 twice gives

Then any integer of the form
is a solution to the congruence, where
is any integer.
Answer:
B. (0,0)
Step-by-step explanation:
The y-intercept of the equation f(x) = 1/2x lies on the y-axis.
This means we need to set x = 0 and solve for y
1/2(0) = 0
Therefore, (0,0) is the y-intercept of this equation.
Answer:
2
x^
2
+
7
x
−
5
Step-by-step explanation:
2x^(2)+6x-8+x+3 and then write in standard form and came up with 2
x^
2
+
7
x
−
5.