Arelation r on a set x is an equivalence relation if r is reflexive, symmetric, and transitive. fix an integer m ≥ 2 . show that the relation defined on the set z of integers by a r b ( a , b ∈ z ) if and only if a ≡ b ( mod m ) is an equivalence relation. (recall that a ≡ b ( mod m ) means that when dividing a by m and b by m you get the same remainder.)

just find the gcf and solve the gcf's until you get each answer i have a really good feeling somethings missing xd (like the dimensions of the fence) *cough *cough *hint *hint

step-by-step explanation:

i think it is 70

step-by-step explanation:

1^3 + 2^3 + 3^3 +4^3 = (1+2+3+4)^2

step-by-step explanation:

i am only able to answer the first part. i am not sure about the second part. sorry