Scribd
Upload
15 views3 pages

Num HW0402

Uploaded by

Triết Nguyễn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views3 pages

Num HW0402

Uploaded by

Triết Nguyễn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Raji 5.

1, The order of integers and primitive roots:


1. Determine ord13 10.
The powers of 10 modulo 13 are: 10 = 3, 9, 1, 3, 4, 1. So ord13 10 = 6.
Notice that 103 = 1, a sign that we haven’t made a mistake. Another
comforting fact is that ' (13) = 12 and 6 is a divisor of 12.
2. Determine ord11 3.
The powers of 3 modulo 11 are: 3, 9, 5, 4, 1. So ord11 3 = 5. That’s
consistent with ' (11) = 10 because 5 is a divisor of 10.
3. Show that 5 is a primitive root of 6.
That means that ord6 5 = ' (6) = 2. Indeed, 52 = 1 (mod 6).
4. Show that if a is an inverse of a modulo n, then ordn a = ordn a.
It su¢ ces to show that ak = 1 (mod n) if and only if ak = 1 (mod n).
But that follows from ak ak = 1 (mod n), which I suppose is proved by
induction on k.
5. Show that if n is a positive integer, and a and b are integers relatively
prime to n such that gcd (ordn a; ordn b) = 1, then ordn (ab) = ordn a
ordn b.
Let x = ordn a and y = ordn b and z = ordn (ab). We want to show xy = z.
xy y x
Now (ab) = (ax ) (by ) = 1y 1x = 1 (mod n), so z j xy by Theorem 54.
z
Conversely, as (ab) = 1 (mod n). Then az bz = 1 (mod n), so bz =
az (mod n). But ordn az = ord az because az az = 1, so ordn az = ordn bz .
From Theorem 57, ordn az = x= gcd (x; z) and ordn bz = y= gcd (y; z), so
x= gcd (x; z) = y= gcd (y; z). But gcd (x; y) = 1, so gcd (x; z) = x and
gcd (y; z) = y. Thus x j z and y j z. As gcd (x; y) = 1, it follows that
xy j z. Hence xy = z.
6. Show that if a is an integer relatively prime to the positive integer m and
ordm (a) = st, then ordm at = s.
Looks like a job for Theorem 57 which tells us that ordm at = st= gcd (st; t) =
st=t = s.
7. Show that if a and n are relative prime, with n > 0, then ordn (a) j ' (n).
Euler’s theorem says that a'(n) = 1 (mod n). The result then follows from
Theorem 54.

Raji 5.2, Primitive roots for primes:


1. Find the incongruent roots modulo 11 of x2 + 2.
By Theorem 59, there can be at most two. I suppose we just try until we
…nd them. 02 + 2 = 2, 12 + 2 = 3, 22 + 2 = 6, 32 + 2 = 11 0 (mod 11),
bingo! So 3 is a root. Of course 3 will also be a root, so the roots are 3
and 3, or, if you will, 3 and 8.

1
2. Find the incongruent roots modulo 11 of x4 + x2 + 1.
We calculate:
04 + 02 + 1 = 1,
14 + 12 + 1 = 3,
24 + 22 + 1 = 21 10 (mod 11),
4 2
3 + 3 + 1 = 91 3 (mod 11),
The …rst four powers of 4 are 4; 5; 9; 3 so 44 + 42 + 1 3 + 5 + 1 = 9,
4 2
The …rst four powers of 5 are 5; 3; 4; 9 so 5 + 5 + 1 9+3+1 2.
That’s as far as we have to go because 6 5, 7 4, etc., and all the
exponents in the polynomial are even. So there are no roots of x4 + x2 + 1
modulo 11.
3. Find the incongruent roots modulo 13 of x3 + 12.
This is the same as solving x3 1, because 12 1. So just compute
the cubes of the numbers 0; 1; 2; 3; 4; 5; 6. The …rst …ve of these
give are 0, 1, 8, 1, 1. We can quit because we have found three
roots: 1, 3, and 4.
5. Find a complete set of incongruent primitive roots of 13.
To do this, we have to compute powers. It’s convenient to note that
multiples of 13 are 26; 39; 52; 65; 78; 91; 104; 117.
The powers of 2 are: 2; 4; 8; 3; 6; 1; 2; 4; 8; 3; 6; 1. So 2 has order
12, hence is a primitive root.
The powers of 3 are: 3; 9; 1. So 3 has order 3, hence is not a primitive
root.
The powers of 4 are: 4; 3; 1; 4; 3; 1. So 4 has order 6, hence is not a
primitive root.
The powers of 5 are: 5; 1; 5; 1. So 5 has order 4, hence is not a primitive
root.
The powers of 6 are: 6; 10; 8; 9; 2. But we know 2 is a primitive root, hence
so is 6.
The powers of 7 are: 7; 10; 5; 9; 11; 12 = 1; 7; 10; 5; 9; 11; 1. So 7
has order 12, hence is a primitive root.
The powers of 8 are: 8; 1; 8; 1. So 8 has order 4, hence is not a primitive
root.
The powers of 9 are 9; 3; 1. So 9 has order 3, hence is not a primitive root.
The powers of 10 are 10; 9; 1; 10; 9; 1. So 10 has order 6, hence is not
a primitive root.
The powers of 11 are 11; 4; 5; 3; 7; 1; 11; 4; 5; 3; 7; 1. So 11 has
order 12, hence is a primitive root

2
The powers of 12 are 12; 1. So 12 has order 2, hence is not a primitive
root.
So the primitive roots are 2, 6, 7, and 11. There are supposed to be
' (12) = ' (3) ' (4) = 2 2 = 4 of them, so that looks right.

You might also like