So, what seems to be the problem?
Let A and B be subsets of the set Z of all integers, and let F denote the set of all functions f : A--> B. Define a relation R on F by: for any f,g F, fRg if and only if f-g is a constant function; that is, there is a constant c so that f(x) - g(x) = c for all x A.
I need to prove that R is an equivalence relation on F.
Please confirm that you know what "reflexive" is. Because if you do, the fact that R is reflexive should be obvious to you. (You know that y - y = 0 for all y, don't you?) On the other hand, if you don't know what "reflexive" means, asking a question that hides this lack of knowledge on a forum is not the best idea. Instead, you should read your textbook or lecture notes or look it up in Wikipedia, MathWorld or a similar site.
Alright i hope this is correct:
Reflexive: fRf = f(x)-f(x) for x (element of) A
=0 which is a constant. Therefore reflexive
Symmetric: There exists f,g (element of) F if fRg, then gRf
gRf = g(x) - f(x)
=-(f(x) - g(x))
Still a little confused on transitivity.
R is reflexive iff for all f ∈ F, fRf. Fix an arbitrary f ∈ F. Then fRf iff there exists a c such that for all x ∈ A, f(x) - f(x) = c. Consider c = 0 and fix an arbitrary x ∈ A. Indeed, f(x) - f(x) = 0, as required.
R is symmetric iff for all f, g ∈ F, fRg implies gRf. Fix arbitrary f and g ∈ F and assume fRg. This means that there exists a c such that for all x ∈ A, f(x) - g(x) = c. We need to show gRf, i.e., there exists a c' such that for all x ∈ A, g(x) - f(x) = c'. Take c' = -c and fix an arbitrary x ∈ A. Then g(x) - f(x) = -(f(x) - g(x)) = -c, as required.
Follow Plato's hint on transitivity.
You may notice that this problem requires proving propositions as well as using assumptions of the form "for all x, A(x)", "there exists an x such that A(x)" and "A implies B". I recommend going over how to do this again.