Wikipedia:Reference desk/Archives/Mathematics/2020 March 9

= March 9 =

Equivalence classes | Integers mod n | Group theory
I need proof. How

[n]=[0]

[-a]=[n-a]

— Preceding unsigned comment added by 192.161.6.65 (talk) 14:30, 9 March 2020 (UTC)


 * And in this case, a bit more context would be really helpful. Until then, you might find the articles at Modular arithmetic and Cyclic group helpful. –Deacon Vorbis (carbon &bull; videos) 14:45, 9 March 2020 (UTC)
 * And in this case, a bit more context would be really helpful. Until then, you might find the articles at Modular arithmetic and Cyclic group helpful. –Deacon Vorbis (carbon &bull; videos) 14:45, 9 March 2020 (UTC)

This contradiction because there are plenty proofs in the wiki

Second, how do you want to be questions

Please. I need to proof — Preceding unsigned comment added by 185.181.55.125 (talk) 17:04, 9 March 2020 (UTC)


 * Perhaps what you need is Equivalence class. -- ToE 17:44, 9 March 2020 (UTC)


 * What you are asking is almost like asking for a proof that 0 + 0 = 0. The proof is really simple. But you need to use the definitions as they have been given in class. In any case, the advice given by ToE is sound. The integers mod n are equivalence classes. They are based on an equivalence relation. This must have been explained in your class notes or textbook. The equivalence relation is also described in our article on Modular arithmetic. And at Equivalence class you can read how the properties of the equivalence relation and the equivalence classes are connected. --Lambiam 18:11, 9 March 2020 (UTC)


 * There is no contradiction here. Yes, it's true there are plenty of proofs in Wikipedia - and you are free to seek one you need, and use it if you find it. But there is no on-demand proof writing service here, so you can't expect someone writes it right now, just because you need it. That's not how encyclopedia works. --CiaPan (talk) 15:50, 10 March 2020 (UTC)