Directions: Written assignments must be typeset. While it is neither necessary nor desirable to show small details of computation, you must indicate what you are doing and explain any reasoning used. Accuracy is important in completing this assignment.
If you are in the writing intensive division of the course, you must complete each written assignment in a satisfactory way. This may require re-submission, possibly more than once, after the initial evaluation.
Find the least non-negative residue of 2^{129} (mod 1025).
List all solutions that are distinct mod 40 for each of the following congruences:
3 x EQUIV 1 (mod 40).
3 x EQUIV 25 (mod 40).
28 x EQUIV 43 (mod 40).
59 x EQUIV 74 (mod 40).
25 x EQUIV 55 (mod 40).
List the number of distinct solutions mod 121461 for each of the following congruences:
48 x EQUIV 771 (mod 121461)
48 x EQUIV 6 (mod 121461)
48 x EQUIV 256 (mod 121461)
Prove that a and d have no common factor if there exist integers b and c such that
| a c + b d = 1 . |
Let a, b, and c be integers with a, b > 0. Prove that if there is an integer point (r, s) on the line
| a x + b y = c , |
then there is one and only one integer point (x, y) on the line for which
| 0 <= x < {b}/{gcd(a, b)} . |