4. (a) For n eZ, define multiplication mod n by ao b-a b (where indicates regular real number multiplication), prove that On is a binary operation on Zn. That is, (Hint your proof will be very similar to the proof for homework 4 problem 7ab) (b) Let n E Z. Is the binary algebraic structure 〈L,On) always a group? Explain. (c) Prove There exists be Zn such that a n I if and only if (a, n)1. (d) It is...
(2) Define the set A C 2 by s) n-0 (a) Prove that for any N 2 0 the set is compact. (b) Prove that for any є > 0 there exists some N > 0 so that for any x E A we have (c) Prove that A is totally bounded. (d) Prove that A is compact (2) Define the set A C 2 by s) n-0 (a) Prove that for any N 2 0 the set is compact....
Problem 11.21. For k є Z, we define Ak-{x є Z : x-51+ k for some 1 є z} (a) Prove that {Ak : k Z} partitions Z. (b) We denote by ~ the equivalence relation on Z that is obtained from the par- tition of part (a). Give as simple a description ofas possible; that is, given condition "C(x,y)" on x and y s x~y if and only if "C(x, y)" holds. Problem 11.21. For k є Z, we...
Prove the given definition, for parts a) through c). Lemma 9.3.5 (Orthogonality Lemma). Fir N and let w-wN-e2mi/N be the natural primitive Nth root of unity in C. Fort Z/(N), we have: N-1 ktN ift-0 (mod N), 0 otherwise. Lukt (9.3.5) k-0 9.3.2. (Proves Lemma 9.3.5) Fix N є N, and let w-e2m/N. Let f(x)-r"-1. o510 (a) Explain why N-1 (9.3.9) (Suggestion: Try writing out the sum as 1 +z+....) (b) Explain why for any t є z/(N), fw)-0. (c)...
Problem 2. Let C[0, 1] be the set of all continuous functions from [0, 1] to R. For any f, g є Cl0, 11 define - max f(x) - g(z) and di(f,g)-If(x) - g(x)d. a) Prove that for any n 2 1, one can find n points in C[O, 1 such that, in daup metric, the distance between any two points is equai to 1. b) Can one find 100 points in C[0, 1] such that, in di metric, the...
I do not need the two metrics to be proved (that they are a metric). Problem 2. Let C[0, 1] be the set of all continuous functions from [0, 1] to R. For any f, g є Cl0, 11 define - max f(x) - g(z) and di(f,g)-If(x) - g(x)d. a) Prove that for any n 2 1, one can find n points in C[O, 1 such that, in daup metric, the distance between any two points is equai to 1....
2 (1) For z E C, define exp z - n-0 (a) Prove that the infinite series converges absolutely for z E C (b) Prove that when z є R, the definition of exp z given above is consistent with the one given in problem (2a), assignment 16. Definition from Problem (2a): L(x(1/t)dt E(z) = L-1 (z) 2 (1) For z E C, define exp z - n-0 (a) Prove that the infinite series converges absolutely for z E C...
discrete math Search il 17:16 [Problem] 1 (a) Give an external definition of the set S {sls EZA+ and gcd(x, 12) 1) (B) Write all the proper subsets of the set {1, 2 3}, and (c) define the function for real number a and positive integer n ,f: RxZ^+ R as f (a,n) a^n , Give a recursive definition of the function (d) Calculate gcd (60, 22) using Euclidean algorithm (e) Give 3 positive integer x that satisfies 4x 6...
We know that we can reduce the base of an exponent modulo m: a(a mod m)k (mod m). But the same is not true of the exponent itself! That is, we cannot write aa mod m (mod m). This is easily seen to be false in general. Consider, for instance, that 210 mod 3 1 but 210 mod 3 mod 3 21 mod 3-2. The correct law for the exponent is more subtle. We will prove it in steps (a)...
probelms 9.1 9 Modular arithmetic Definition 9.1 Let S be a set. A relation R = R(,y) on S is a statement about pairs (x,y) of elements of S. For r,y ES, I is related to y notation: Ry) if R(x,y) is true. A relation Ris: Reflexive if for any I ES, R. Symmetric if for any ry ES, Ry implies y Rr. Transitive if for any r.y.ES, Ry and yRimply R. An equivalence relation is a reflexive, symmetric and...