Scribd
Upload
161 views1 page

Homework 5

This document provides the homework problems for MAT 310 that are due on October 17. The homework includes solving several linear congruences modulo various numbers, constructing congruences with no solutions, one solution, and multiple solutions, solving systems of congruences, and finding integers that satisfy several divisibility conditions. It also asks students to solve a system of congruences using the Chinese Remainder Theorem or find an equivalent system that can be solved using the Chinese Remainder Theorem.

Uploaded by

Ryan Wilson
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
161 views1 page

Homework 5

This document provides the homework problems for MAT 310 that are due on October 17. The homework includes solving several linear congruences modulo various numbers, constructing congruences with no solutions, one solution, and multiple solutions, solving systems of congruences, and finding integers that satisfy several divisibility conditions. It also asks students to solve a system of congruences using the Chinese Remainder Theorem or find an equivalent system that can be solved using the Chinese Remainder Theorem.

Uploaded by

Ryan Wilson
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/ 1

Fall 2017

MAT 310 Homework 4


Due Tuesday, October 17
Hand in problems: 1, 2, 3ab, 5, 7
1. Solve each of the following:

(a) 2x ≡ 1( mod 19)


(b) 3x ≡ 1( mod 19)
(c) 4x ≡ 6( mod 18)
(d) 20x ≡ 984( mod 1984)

2. Construct linear congruences modulo 20 with no solutions, just one solution, and more
than one solutions. Can you find one with 20 solutions?

3. Solve the systems:

(a) x ≡ 1( mod 2), x ≡ 2( mod 3)


(b) x ≡ 2( mod 5), 2x ≡ 3( mod 7), 3x ≡ 4( mod 11)
(c) x ≡ 31( mod 41), x ≡ 59( mod 26)

4. Solve 4x ≡ 9( mod 1453)

5. Find a multiple of 7 that leaves the remainder 1 when divided by 2, 3, 4, 5, or 6.

6. Find the smallest integer n, n > 2, such that 2|n, 3|n + 1, 4|n + 2, 5|n + 3, and 6|n + 4.

7. Solve the following system: 


x ≡ 1(


mod 2)
x ≡ 2( mod 5)


 x ≡ 5( mod 6)
x ≡ 5(

mod 12)
Can you use the Chinese Remainder Theorem for this system? Can you find an equiv-
alent system where you can use the Chinese Remainder Theorem?

You might also like