MATH 312 HOMEWORK 6
Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: daixieit
HOMEWORK 6
MATH 312
Problem 1 . (3 points.) Let n e N. Find the number of solutions to the congru- ence equation
x2 三 0 (mod n).
Problem 2. (3 points.) Let n e N. Show that there exist n consecutive positive integers m + 1, m + 2, . . . , m + n with the property that for each k e {1, 2, . . . , n}, the congruence equation
x2 + 1 三 0 (mod m + k)
is not solvable.
Problem 3. (3 points.) Let p1 , . . . , pm be distinct prime numbers, and let
n := p1 . p2 . . . . . pm .
Find the number of solutions to the congruence equation:
x4 三 1 (mod n).
Problem 4 . (3 points.) Let n > 2 be an integer. Prove that n is a prime number if and only if
(n _ 2)! 三 1 (mod n).
2022-11-01