Can someone write a proof for this
Favorites|Homepage
Subscriptions | sitemap
HOME > Mathematics > Can someone write a proof for this

Can someone write a proof for this

[From: ] [author: ] [Date: 11-11-03] [Hit: ]
......
Let a,b,n be any integer where n is > or equal to 2. Prove that is a is congruent to b (mod n) than a^2 is congruent to b^2 (mod n)

-
Suppose
a-b = kn
is a integer multiple of n.

Then
a^2 - b^2 = (a-b)(a+b) = k(a+b)n
is an integer multiple of n.
1
keywords: proof,for,Can,this,write,someone,Can someone write a proof for this
New
Hot
© 2008-2010 http://www.science-mathematics.com . Program by zplan cms. Theme by wukong .