
please do 7.19 7.20 and
7.21
7.19 Theorem (Quadratic Reciprocity Theorem and q be odd primes, then Reciprocity Part). Let p (e)99 (mod 4) if p (mod 4) or q1 i p 3 (mod 4). (i)) (llint: Iry to use the techniquets used in the case of Putting together all our insights, the Law of Quadratic Reciprocity. we can write one theorem that we call Theorem (Iaw of Quadratic Reciprocity). Let p and q be odd primes, then if p...
Prove that a(a + 1)(2a + 1) is divisible by 6 for integer a using a quicker proof of this, based on the observation that 6 I m (6 divides m) if and only if 2 I m (2 divides m) and 3 I m (3 divides m). Please use modulo congruences.
5. (a) Let m,n be coprime integers, and suppose a is an integer which is divisible by both m and n. Prove that mn divides a. (b) Show that the conclusion of part (a) is false if m and n are not coprime (ie, show that if m and n are not coprime, there exists an integer a such that mla and nla, but mn does not divide a). (c) Show that if hef(x,m) = 1 and hcf(y,m) = 1,...
9. Use the construction in the proof of the Chinese remainder theorem to find a solution to the system of congruences X 1 mod 2 x 2 mod 3 x 3 mod 5 x 4 mod 11 10. Use Fermats little theorem to find 712 mod 13 11. What sequence of pseudorandom numbers is generated using the linear congruential generator Xn+1 (4xn + 1) mod 7 with seed xo 3?
9. Use the construction in the proof of the Chinese...
1. [10 marks] Modular Arithmetic. The Quotient-Remainder theorem states that given any integer n and a positive integer d there exist unique integers q and r such that n = dq + r and 0 r< d. We define the mod function as follows: (, r r>n = qd+r^0<r< d) Vn,d E Z d0 Z n mod d That is, n mod d is the remainder of n after division by d (a) Translate the following statement into predicate logic:...
(1 pt) For n a nonnegative integer, either n = 0 mod 3 or n = 1 mod 3 or n = 2 mod 3. In each case, fill out the following table with the canonical representatives modulo 3 of the expressions given: n mod 3 nº mod 3 2n mod 3 n3 + 2n mod 3 From this, we can conclude: A. Since n+ 2n # 0 mod 3 for all n, we conclude that 3 does not necessarily...
UUIDOR Quiz 2 - Ma Consider the following theorem. Theorem: The sum of any even integer and any odd integer is odd. Six of the sentences in the following scrambled list can be used to prove the theorem. By definition of even and odd, there are integers rands such that m = 2r and n = 2s + 1. By substitution and algebra, m + n = 2r + 25 + 1) = 2(r + s) + 1. Suppose m...
1. Recall the following theorem. Theorem 1. Let a, b, m,n e N, m, n > 0 and ged(m,n) = 1. There erists a unique r e Zmn such that the following holds. x = a (mod m) x = b (mod n) please show that such solution is unique.
please answer questions #7-13
7. Use a direct proof to show every odd integer is the difference of two squares. [Hint: Find the difference of squares ofk+1 and k where k is a positive integer. Prove or disprove that the products of two irrational numbers is irrational. Use proof by contraposition to show that ifx ty 22 where x and y are real numbers then x 21ory 21 8. 9. 10. Prove that if n is an integer and 3n...
3. [10 points] Consider the following theorem. Theorem. Assume that m is an integer that leaves a remainder of 6 upon division by 8. Assume furthermore that n is an integer that leaves a remainder of 3 upon division by 8. Then the product m n leaves a remainder of 2 upon division by 8. Consider the tollowing theorern. (a) Illustrate the theorem using an example. (b) Prove the theorem.