-3

9 = 2^X mod 11

What is X and how do you find X?

flag
1 
I've retagged it, since this has nothing to do with modular-forms. Howeevr I don't believe this is an appropriate question to MO. Please read the FAQ. – José Figueroa-O'Farrill Nov 28 at 13:16
...although it's trickier than the probability question that got answer after answer ;-) – Kevin Buzzard Nov 28 at 13:53
@buzzard which probability question? – Anton Geraschenko Nov 28 at 15:48
I think this problem is believed to be NP-complete (for composite modulus) and is the basis of the RSA encrypting algorithm. I don't think it should be closed. – SixWingedSeraph Nov 28 at 16:30
@Anton: I think that buzzard means mathoverflow.net/questions/7004/… – José Figueroa-O'Farrill Nov 28 at 18:05
show 2 more comments

closed as too localized by David Speyer, Anton Geraschenko♦♦ Nov 28 at 15:39

1 Answer

2

Although this smells, walks and talks like homework, a good starter could be to read http://en.wikipedia.org/wiki/Discrete_logarithm (For you particular example, try to think how many $X$ you would have to try until you can be sure to have checked all possibilities.)

link|flag

Not the answer you're looking for? Browse other questions tagged or ask your own question.