MAT-3110 Midterm: MATH 3110 App State Spring2015 Test1

18 views5 pages
15 Feb 2019
School
Department
Course
Professor

Document Summary

Be sure to show your work: (20 points) de nition and basics (a) suppose that g is a non-empty set equipped an operation. 5: (b) let g = z 0 be the set of non-negative integers. It can be shown that x y = max{x, y} (example: 3 1 = max{3, 1} = 3) is an associative, commutative (closed) binary operation on g with identity 0. [use a concrete counterexample. ] (c) let g = r q = {x r | x is irrational }. Then nd their orders and the list the elements in cyclic subgroup generated by that element. [note: there may be more spaces than you need. ] x = |x| = hxi = (cid:26) (cid:27) (cid:26) (cid:27) (cid:26) (c) find hai =(cid:28)(cid:20)1 2. What is a 1? (cid:27) (cid:26) (cid:27) (cid:26) (cid:27) (cid:26) (cid:27) (d) find 99 1 mod 123 using run the extended euclidean algorithm on 99 and 123: (15 points) recall dn = {1, x, .

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers

Related Documents

Related Questions