Does anyone know why this is true?
|dw:1354178082387:dw|
Could you use the equation button... I can't make out the end part.
20^n === 3^n mod 17
It can't be true...
but really, i think it should be 20^n mod 17 === 3^n
this is what it says thought so im just wondering why its like that =/
the expression you gave is false, the one i gave i know is correct, but if you got it from somewhere legitimate than i am really curious how it works out...
is there any conditions for n?
does fermat's theorem help you in anyway?
n is even
it works for n = 0, but if its for for all n such that n = 2k where k is any natural number than I'm not sure....
it does not work for n=2. 20=0 (mod 2) 3=1 (mod 2) so 20=3(mod 2) is wrong. so \( 20^n=3^n(mod 2)\)is wrong.
hm.. yea i was wondering how it can be true, but my prof said its true so im not sure what to do
are you sure you got the expression right? because if its my expression which I've given above, then all is good and dandy...
are you sure he didn't leave out any numbers? Either he's mistaken, or there's a number somewhere we missed
yea its exactly like that i can show other examples too
@findme the above expression, 20^n mod 17 === 3^n is not a modulus expression.
let's see it.
|dw:1354178889250:dw|
Join our real-time social learning platform and learn together with your friends!