How to express the congruence m^e ≡ 1 (mod n) as an expression of m?
Has your class done logarithms yet?
discrete logarithms? yes
I am sorry but the last time I did this was a while back the form they want this in is m=something else correct?
yes , modulo n
ahhh sorry thought I had more time. I actually am at University right now and my class is about to start so very sorry if you cannot get someone else to help you out try a site called wolfram alpha It is a site capable of doing complex math and with a little playing around you may be able to get it to do what you need to here.
if m^e = 1 mod(n) then m = 1^(1/e) mod n or m= 1 modn = denotes congruence relation..
aha, thanks anyway
thanks. yes, but 1/e would not necessarily be an integer. the original problem is to find an integer m with given positive integers e and c such that m=e^c
if there is such an integer, of course
8 = 2^3 ??
yes, for example. then you give c = 8, e = 3, and it would yield 2. I need to find a test to find this number, if this exists
ohh i see..
m=e^c whats your variable here,,i mean if e and c both are integers..them m surely is an integer..
oh. sorry, i messed up: it should be c = m^e, c and e is given, and m is to find
@mukushla might aid ,,
Do you still need help @jsaetrum ?
hi, yes, thanks :)
Join our real-time social learning platform and learn together with your friends!