Академический Документы
Профессиональный Документы
Культура Документы
Show all your work. Justify your solutions. Answers without justification will not receive full marks.
Only hand in the problems on page 2.
Practice Problems
Question 1. Using the Prime Number Theorem, estimate the number of prime numbers between
2 million and 7 million.
Solution:
The number of primes between 2000000 and 7000000
= π(7000000) − π(1999999)
≈ 7000000/ log(7000000) − 1999999/ log(1999999)
≈ 306274.
Question 2.
Solution:
(a)
ϕ(1200) = ϕ(24 · 3 · 52 ) = ϕ(24 ) · ϕ(3) · ϕ(52 ) = (1 · 23 )(2 · 30 )(4 · 51 ) = 320
Question 3.
Question 4. Find the two smallest positive integer solutions to the following system of equivalences
x ≡ 2 (mod 5)
x ≡ 5 (mod 8)
x ≡ 4 (mod 37)
Question 5.
2
2301 Assignment 2 Due Thursday 1st April, 2 pm
Thus 2 has order 18 = ϕ(27) and is a primitive root, while 8 has order 6 and is not a primitive root.
(c) From the above table, 13 ≡ 28 (mod 27). Since 2 is a primitive root and x ∈ (Z/27Z)× , x is some
power of 2 (mod 27). So let x = 2y . Then
x7 ≡ 13 (mod 27)
becomes
(2y )7 = 27y ≡ 28 (mod 27).
Then since 2 has order ϕ(27) = 18,
7y ≡ 8 (mod 18).
Multiplying both sides by 13 (find by trial and error or Euclid’s algorithm) gives y ≡ 14 (mod 18),
which we substitute back to get x ≡ 214 ≡ 22 (mod 27).
3
2301 Assignment 2 Due Thursday 1st April, 2 pm
Assignment Problems
Question 1.
Solution:
(a) 30
(b) 181
(c) 528.
Question 2. Your Facebook friend posts the RSA public key (N = 3551, e = 1565), hoping
for secret messages from fans of repeated squaring. While looking through their rubbish, you find a
scrap of paper with the number 67 on it, one of your favourite primes. You instantly know that it is
significant. Find your friend’s private key.
Solution: The significance of 67 is that it is a factor of N = 3551, and using it we obtain the prime
factorization of N , namely N = 53 · 67. Thus ϕ(N ) = 52 · 66 = 3432. The private key, d, is the inverse
of e = 1565 modulo 3432. We find it using Euclid’s algorithm:
3432 1 0
2 1565 0 1
5 302 1 −2
5 55 −5 11
2 27 26 −57
27 1 −57 125
0
Thus the private key is 125.
Question 3. Find the smallest positive integer x satisfying the following system, or show that no
such x exists:
2x ≡ 1 (mod 3)
3x ≡ 2 (mod 5)
4x ≡ 3 (mod 7)
5x ≡ 4 (mod 11)
Hint: First multiply the first equation by 2−1 , the second by 3−1 etc.
Solution: 2−1 ≡ 2 (mod 3), 3−1 ≡ 2 (mod 5), 4−1 ≡ 2 (mod 7), 5−1 ≡ 9 (mod 11), so the system
becomes
x ≡ 2 (mod 3)
x ≡ 4 (mod 5)
x ≡ 6 (mod 7)
x ≡ 3 (mod 11)
We solve this via the CRT: x ≡ 839 (mod 1155). So the smallest positive solution is x = 839.
4
2301 Assignment 2 Due Thursday 1st April, 2 pm
(
−1 n/2, if n is even
f (n) =
−(n + 1)/2, if n is odd.
Determine if ?, ◦, and • are associative. For the associative operations, determine if there is an
identity element.
Solution: All three are binary operations on G.
Check associativity:
(a, b) ? (c, d) ? (e, f ) = (a + c, 2c b + d) ? (e, f ) = (a + c + e, 2e (2c b + d) + f )
c+e e
= (a + c + e, 2 b + 2 d + f ).
(a, b) ? (c, d) ? (e, f ) = (a, b) ? (c + e, 2e d + f ) =
= (a + c + e, 2c+e b + 2e d + f ).
(a, b) ◦ (c, d) ◦ (e, f ) = (a + c, 2−c b + d) ◦ (e, f ) = (a + c + e, 2−e (2−c b + d) + f )
−(c+e) b + 2−e d + f ).
= (a + c + e, 2
(a, b) ◦ (c, d) ◦ (e, f ) = (a, b) ◦ (c + e, 2−e d + f ) =
= (a + c + e, 2−(c+e) b + 2−e d + f ).
(a, b) • (c, d) • (e, f ) = (a + c, 2c b − d) • (e, f ) = (a + c + e, 2e (2c b − d) − f )
c+e e
= (a + c + e, 2 b − 2 d − f ).
(a, b) • (c, d) • (e, f ) = (a, b) • (c + e, 2e d − f ) = (a + c + e, 2c+e b − (2e d − f ))
= (a + c + e, 2c+e b − 2e d + f ).
So • is not associative.
Check identity:
If (a, b) ? (c, d) = (a, b) then a + c = a, 2c b + d = d so c = 0 and b + d = b so d = 0. So if there
is an identity, it must be (0, 0). Check: (a, b) ? (0, 0) = (a + 0, 20 b + 0) = (a, b) and (0, 0) ? (a, b) =
(0 + a, 2a 0 + b) = (a, b). So (0, 0) is the identity.