Is there an algorithm which, given n, returns an integer x such that 2 has order n modulo x (i.e, 2^n = 1 mod x and n is the smallest positive solution)? Is there any such algorithm which runs faster than factoring n?(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# How can I find a x such that the order of 2 mod x is n?

Loading...

Similar Threads for find such order |
---|

I How to find admissible functions for a domain? |

I How to find the matrix of the derivative endomorphism? |

I Finding the Kernel of a Matrix Map |

**Physics Forums | Science Articles, Homework Help, Discussion**