Let q be an odd prime power. Let n be the multiplicative order of q modulo t, where t is even and t > 4. What are the values of t for which the following claim fails?(adsbygoogle = window.adsbygoogle || []).push({});

Claim: n is the multiplicative order of q modulo t/2.

I came across this as I was computing some minimal polynomials m(x) of alpha^2 where alpha is a root of some irreducible polynomial f(x) over GF(q). I noticed that all the time I was getting deg m(x) = deg f(x) which is interesting. So I did a few examples to see for which t this fails. I tried q = 3, 5, 7, 11. I found that claim fails when q = 1 mod t, or q = 1 mod t/2, but sometimes fails when t = 8, 16, 32... However, sometimes it it fails "mysteriously". For example, when q = 11 claim fails for t = 28. What is the pattern here?

**Physics Forums - The Fusion of Science and Community**

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!

# Multiplicative order modulo t and t/2.

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads - Multiplicative order modulo | Date |
---|---|

B Associativity of Matrix multiplication | Jun 9, 2017 |

Matrix multiplication preserve order Block matrix | Aug 1, 2011 |

Show multiplicative order is multiplicative (told this was easy but I can't see it) | May 3, 2008 |

Multiplicative order | Sep 9, 2007 |

A formula related to multiplicative order | Jul 4, 2007 |

**Physics Forums - The Fusion of Science and Community**