Answer:
Step-by-step explanation:
In where my friend
Mark me as brainliest
The answer is (x,y) —> (y,-x)
(Hard) A composite number n is called a Carmichael number bn−1 ≡ 1 (mod n) for every number b such ... Base case: When n = 2 the formula a + c ≡ b + d (mod m) was already given. ... The sequence goes 1, 3, 7, 15, 31,... guess that it is equal to 2n+1 − 1. ... Prove (now using induction on n) that fm|fmn for all n ≥ 1.
Answer:
A
Step-by-step explanation:
y=4x+6
y=6-4x
y=12
y=4x+6
12=4x+6
12-6=4x
6/4=4x/4
x=3/2
