# math

posted by .

prove -x-y=-y-x, for all integers

• math -

I do not know what grade you're in, but questions of this sort could go quite deep into algebra.

Since x,y are integers, which belong to a ring in which additions are commutative, so if we write the subtractions as inverses of addition, the above would be invoking commutativity in the ring-addition:

-x-y

For high-school algebra, then it would be the commutative property of addition and subtraction.

## Similar Questions

1. ### discrete math

use a direct proof to show that the product of two odd numbers is odd. Proofs: (all the nos. i used are odd) 3 x 3 = 9 5 x 9 = 45 7 x 3 = 21 Yes, but you didn't prove the statement for "all" odd integers, only the odd integers you …
2. ### discrete math

Let A= {for all m that's an element of the integers | m=3k+7 for some k that's an element of positive integers}. Prove that A is countably infiite. Note: you must define a function from Z+ to A, and then prove that the function you …
3. ### math

. Prove that -x - y = -y – x; for all integers x and y.
4. ### discrete math

Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one?
5. ### math

Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one?

Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, and k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one?
7. ### Math

1) Given the arithmetic sequence an = 4 - 3(n - 1), what is the domain for n?