Scribd
Upload
5 views1 page

Math 4000/6000 Homework 2 Problems

This document provides the homework problems for Math 4000/6000 due on January 25th. It consists of 9 problems covering topics from section 1.3 to 2.2 in the textbook. Problems must be written neatly and stapled. Starred problems are required for students in the higher-level course. Students can consult any materials when working on the problems but should acknowledge if they find a complete solution elsewhere.

Uploaded by

shidaru65
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
5 views1 page

Math 4000/6000 Homework 2 Problems

This document provides the homework problems for Math 4000/6000 due on January 25th. It consists of 9 problems covering topics from section 1.3 to 2.2 in the textbook. Problems must be written neatly and stapled. Starred problems are required for students in the higher-level course. Students can consult any materials when working on the problems but should acknowledge if they find a complete solution elsewhere.

Uploaded by

shidaru65
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

Math 4000/6000: Homework 2

Due: Beginning of class on 1/25


Homeworks should be written up NEATLY and STAPLED!
This homework roughly covers the material in Hungerford (H) 1.3 2.2. You
may freely refer to results proved in the textbook or in lecture. Starred problems
are required for students in Math 6000 and optional otherwise. Feel free to consult
any materials you like, but if you find a solution to one of the problems written up
somewhere (e.g. in the book), please do look at it.
Problem 1. (H 1.3.20) Given a, b N with prime factorizations a = pr11 prkk and
b = ps11 pskk with pi distinct primes and ri , si 0, prove that:
min(r ,s )

min(r ,s )

1 1
k k
(i) (a, b) = p1
pk
;
max(r1 ,s1 )
max(rk ,sk )
(ii) [a, b] = p1
pk
.

Problem 2.
(i) Show that for a, b Z, if a3 |b2 then a|b.
(ii) Show that for any g, ` N, there are a, b Z with (a, b) = g and [a, b] = ` if
and only if g|`.
Problem 3. (H 2.1.11) If a, b N with a b mod p for every prime p, prove that
a = b.
Problem 4. (H 2.1.19) Prove or disprove: if a b mod n, then (a, n) = (b, n).
Problem 5. (H 2.1.22)
(i) Give and example to show that the following statement is false: if ab
ac mod n and a 6 0 mod n then b c mod n.
(ii) Prove that the statement in (i) is true if a and n are coprime.
Problem 6. Show that for any a, b Z and any prime p,
(a + b)p ap + bp mod p.
Problem 7. Suppose d, n N and d|n. Show that every congruence class [x] Z/dZ
is a disjoint union of n/d congruence classes mod n. Find representatives for them.
Problem 8. For a, b Z and n N, we know
ax b mod n

()

has solutions iff (a, n)|b, and we know that if x is a solution, then every element of
[x] Z/nZ is a solution. The goal of this problem is to determine how many solutions
in Z/nZ there are.
(i) Suppose
for d N we have d|a, d|b, and d|n. Prove that ax b mod n iff

a
b
n
d x d mod d .
(ii) Using part (i), prove that the solutions to () are a single congruence class
n
.
mod (a,n)
(iii) Conclude now using the previous problem that there are n/(a, n) distinct solutions to () in Z/nZ.
*Problem 9. Prove that there are infinitely many primes of the form 6x+5 for x Z.

You might also like