Register to reply

Congruence relation

by burritoloco
Tags: congruence, relation
Share this thread:
Jun21-11, 02:29 AM
P: 85
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?

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?
Phys.Org News Partner Science news on
An interesting glimpse into how future state-of-the-art electronics might work
Tissue regeneration using anti-inflammatory nanomolecules
C2D2 fighting corrosion

Register to reply

Related Discussions
How I & V have inverse relation in power equation and direct relation in ohm law. Classical Physics 3
F is a field, prove congruence defines an equivalence relation? Calculus & Beyond Homework 0
Solutions to na=0 (mod m) Linear & Abstract Algebra 4
Prove that a relation is an equivalence relation Precalculus Mathematics Homework 4
Using bijectiveness to prove congruence relation Calculus & Beyond Homework 12