a. A\(B∩C) ![]() |
||
b. (A∩C)\(A∩B) ![]() |
||
c. (A∩B)\(A∩C) ![]() |
||
d. ∅ ![]() |
a. 128 ![]() |
||
b. 5040 ![]() |
||
c. 49 ![]() |
||
d. 1 ![]() |
a. 128 ![]() |
||
b. 5040 ![]() |
||
c. 49 ![]() |
||
d. 1 ![]() |
a. {h, i, j} ![]() |
||
b. {h, j, i} ![]() |
||
c. {j, i, k} ![]() |
||
d. {i, h, j} ![]() |
a. a² ![]() |
||
b. b² ![]() |
||
c. ab ![]() |
||
d. None of the above ![]() |
a. f and g are inverses. ![]() |
||
b. The image of f and the image of g are the same. ![]() |
||
c. g°f is onto. ![]() |
||
d. g°f is one-to-one. ![]() |
a. f and g are inverses. ![]() |
||
b. The domain of g°f is B. ![]() |
||
c. If Img( g°f) is C, then f and g are both onto. ![]() |
||
d. A = C ![]() |
a. f is onto. ![]() |
||
b. f is one-to-one. ![]() |
||
c. f is not defined. ![]() |
||
d. f is a bijection. ![]() |
a. a ![]() |
||
b. b ![]() |
||
c. c ![]() |
||
d. 1 ![]() |
a. gcd(a, c) = 1. ![]() |
||
b. gcd(a, c) ≠ 1. ![]() |
||
c. gcd (b, c) = 1. ![]() |
||
d. gcd(b, c) ≠ 1. ![]() |
a. f is onto. ![]() |
||
b. f is one-to-one. ![]() |
||
c. f is well-defined. ![]() |
||
d. f has an inverse. ![]() |
a. ~ defines an equivalence relation. ![]() |
||
b. ~ is symmetric and reflexive, but not transitive. ![]() |
||
c. ~ is symmetric and transitive, but not reflexive. ![]() |
||
d. ~ is a function. ![]() |
a. ak + am must be in A. ![]() |
||
b. (ak)(am) must be in A. ![]() |
||
c. If A is finite, there must be some j in Z for which aj = 1. ![]() |
||
d. All the above ![]() |
a. 19 ![]() |
||
b. 5 ![]() |
||
c. 15 ![]() |
||
d. 3 ![]() |
a. 1 ![]() |
||
b. 4 ![]() |
||
c. 6 ![]() |
||
d. 8 ![]() |
a. R ![]() |
||
b. {-2, -1, 0, 1, 2} ![]() |
||
c. {11, 2, -1, 2, 11} ![]() |
||
d. {35, 2, -1, 2, 35} ![]() |
a. f(x) = 1/x² ![]() |
||
b. f(x) = 3x – 7 ![]() |
||
c. f(x) = ex ![]() |
||
d. f(x) = √2x-1 ![]() |
a. f(x) = 1/x ![]() |
||
b. f(x) = 2x² – 1 ![]() |
||
c. f(x) = ex ![]() |
||
d. f(x) = -2x³ ![]() |
a. f has to be onto. ![]() |
||
b. f has to be one-to-one. ![]() |
||
c. f has to be both one-to-one and onto. ![]() |
||
d. f has to be a function. ![]() |
a. {1, 2, 3, 4, 5} ![]() |
||
b. {2, 4, 5, 1, 3} ![]() |
||
c. {2, 4, 1, 3, 5} ![]() |
||
d. All the above are permutations of A. ![]() |
a. f cannot be one-to-one. ![]() |
||
b. f cannot be onto. ![]() |
||
c. image of f = Q. ![]() |
||
d. f can be a bijection. ![]() |
a. f(x) = 2x – 3, g(x) = 3x + 2 ![]() |
||
b. f(x) = 1/x, g(x) = x ![]() |
||
c. f(x) = 1/x, g(x) = 1/x ![]() |
||
d. f(x) = x, g(x) = -x ![]() |
a. {(2, 1), (2, -4), (1, 5), (1, 7), (3, 6)} ![]() |
||
b. {(2, 1), (1, -4), (3, 1), (2, 7), (4, 7)} ![]() |
||
c. {(1, 1), (2, 2), (3, 3), (4, 4), (5, 5)} ![]() |
||
d. All of the above are functions. ![]() |
a. a ≡ b (mod n) ![]() |
||
b. set of all left cosets of the subgroup H of a set G ![]() |
||
c. set of all (a, b), (c, d) in R² for which a² + b² = c² + d² ![]() |
||
d. All of the above result in equivalence relations. ![]() |
a. {f, h} ![]() |
||
b. {b, d} ![]() |
||
c. {a, c, e} ![]() |
||
d. ∅ ![]() |
a. <n> ![]() |
||
b. np, where p is prime ![]() |
||
c. nZ, where n ∊ {0, 1, 2, 3, 4, …} ![]() |
||
d. Of singleton integers, since no subgroup of Z greater than order 1 can exist. ![]() |
a. Not abelian ![]() |
||
b. Cyclic ![]() |
||
c. A permutation group ![]() |
||
d. Isomorphic to a normal group of the same order ![]() |
a. G must be {e}. ![]() |
||
b. G is abelian. ![]() |
||
c. gcd(m,n) = 1. ![]() |
||
d. mn has to divide the order of G. ![]() |
a. 4 ![]() |
||
b. 14 ![]() |
||
c. 15 ![]() |
||
d. 45 ![]() |
a. H is abelian. ![]() |
||
b. H has a normal subgroup. ![]() |
||
c. The center of H contains only e. ![]() |
||
d. None of the above ![]() |
a. H is abelian. ![]() |
||
b. The center of H contains only e. ![]() |
||
c. H has a cyclic subgroup. ![]() |
||
d. None of the above ![]() |
a. If the range of G = H, then ϕ is an isomorphism. ![]() |
||
b. H is abelian. ![]() |
||
c. H is a subgroup of G. ![]() |
||
d. The range of G in H is {e}. ![]() |
a. H is abelian. ![]() |
||
b. H has a normal subgroup. ![]() |
||
c. H is a cyclic group. ![]() |
||
d. ϕ(x) = e in H implies that x is e in G. ![]() |
a. Aut(G) is a subgroup of the largest cyclic subgroup in G. ![]() |
||
b. Aut(G) is a subgroup of the symmetric group of set G. ![]() |
||
c. Aut(G) is abelian. ![]() |
||
d. Aut(G) has a prime order. ![]() |
a. 12 ![]() |
||
b. 6 ![]() |
||
c. 3 ![]() |
||
d. 2 ![]() |
a. G is abelian. ![]() |
||
b. G has no normal subgroups. ![]() |
||
c. G must have a normal subgroup of order p. ![]() |
||
d. G is isomorphic to an abelian group of order p². ![]() |
a. H ∩ J is a subgroup of G. ![]() |
||
b. H + J = G. ![]() |
||
c. H has no trivial subgroups ![]() |
||
d. J only has a trivial subgroup if H has one. ![]() |
a. H ∩ J is normal in G. ![]() |
||
b. H ∩ J = {e} ![]() |
||
c. H ∩ J = ∅ ![]() |
||
d. None of the above ![]() |
a. G is abelian. ![]() |
||
b. Z(G) is isomorphic to a normal group of the same order. ![]() |
||
c. Z(G) is the only proper subgroup of G. ![]() |
||
d. Z(G) = {e}. ![]() |
a. <a> ∪ <b> is a permutation group. ![]() |
||
b. <a> ∩ <b> = {e}. ![]() |
||
c. <a> ∩ <b> cannot be trivial. ![]() |
||
d. <a> ∩ <b> has a prime order. ![]() |
a. 1 ![]() |
||
b. 5 ![]() |
||
c. 2 ![]() |
||
d. G cannot contain a proper subgroup. ![]() |
a. G has to have a normal subgroup of order p. ![]() |
||
b. G cannot contain a normal subgroup. ![]() |
||
c. G is isomorphic to the symmetric group of a set of order n. ![]() |
||
d. G has to be abelian. ![]() |
a. a must be e. ![]() |
||
b. k must divide n. ![]() |
||
c. n must divide k. ![]() |
||
d. e² cannot be e. ![]() |
a. G is a symmetric group ![]() |
||
b. G is a permutation group. ![]() |
||
c. G has only trivial subgroups. ![]() |
||
d. G is abelian. ![]() |
a. [G:H] = [G:K][H:K] ![]() |
||
b. [G:K] = [G:H][H:K]. ![]() |
||
c. [G:H] = [H:K]/[G:K] ![]() |
||
d. [G:K] = [G:H]/[K:K] ![]() |
a. J under the operation is a group. ![]() |
||
b. The operation is commutative. ![]() |
||
c. The operation is not associative. ![]() |
||
d. The operation splits J into equivalence classes. ![]() |
a. F is not associative under “+.” ![]() |
||
b. F is not commutative under “+.” ![]() |
||
c. F is a non-abelian group under “+.” ![]() |
||
d. F has no nontrivial normal subgroup. ![]() |
a. G = Z under ordinary addition, M = <2>, f: G → M, f(x) = 2x. ![]() |
||
b. G = 2x2 matrices under cross multiplication, M = 2x2 matrices under matrix addition, f: G → M, f(x) = 3x ![]() |
||
c. G = {1}, M = Z, f: G → M, f(x) = 1/x. ![]() |
||
d. G = S4, M = Z, f:G → M, f(x) = 3/(x – 1). ![]() |
a. The set of nXn matrices under matrix addition ![]() |
||
b. The set of integers under ordinary addition ![]() |
||
c. The set of integers under ordinary division ![]() |
||
d. The set of nXn matrices under cross multiplication ![]() |
a. The set of nXn matrices under matrix addition ![]() |
||
b. The set of integers under ordinary division ![]() |
||
c. The set of negative numbers under multiplication ![]() |
||
d. None of the above ![]() |
a. UFD ![]() |
||
b. Integral domain ![]() |
||
c. Ring with unity ![]() |
||
d. Field ![]() |
a. Ring with unity ![]() |
||
b. Commutative ring ![]() |
||
c. Associative ring ![]() |
||
d. Ideal ![]() |
a. Finite ![]() |
||
b. A non-trivial ideal ![]() |
||
c. Commutative ![]() |
||
d. A field ![]() |
a. UFD ![]() |
||
b. Field ![]() |
||
c. Prime ideal ![]() |
||
d. Integral domain ![]() |
a. Ideal ![]() |
||
b. Principle ideal ![]() |
||
c. Equal to {0} only ![]() |
||
d. UFD ![]() |
a. For every a, b in R, ab = 0 ![]() |
||
b. For every a, b in R, if ab is in I, then either a is in I or b is in I ![]() |
||
c. For every a, b in R, ab = 1 ![]() |
||
d. For every a, b in R, if ab is in I, then both a and b must be in I ![]() |
a. Isomorphisms ![]() |
||
b. Homomorphisms ![]() |
||
c. Normal subgroups ![]() |
||
d. Non-abelian groups ![]() |
a. R must be a UFD. ![]() |
||
b. R must be of finite order. ![]() |
||
c. R must be a commutative ring. ![]() |
||
d. The image of R must be the set of rational numbers. ![]() |
a. f must preserve addition only from R to T. ![]() |
||
b. f must preserve addition and multiplication from R to T. ![]() |
||
c. f must have an inverse from T to R. ![]() |
||
d. R must be commutative. ![]() |
a. A quotient ring of R ![]() |
||
b. A prime ideal of R ![]() |
||
c. The maximal ideal of R ![]() |
||
d. The kernel of some homomorphism from R to another ring ![]() |
a. If R is commutative, then T must be commutative. ![]() |
||
b. If x in R is the identity in R, then f(x) must be the identity in T. ![]() |
||
c. The image of R must be T. ![]() |
||
d. All the above ![]() |
a. S must be a maximal ideal. ![]() |
||
b. a = b. ![]() |
||
c. S must be a field. ![]() |
||
d. S = R. ![]() |
a. g is a ring isomorphism by definition. ![]() |
||
b. g is a ring isomorphism only if g is a ring homomorphism. ![]() |
||
c. T must be commutative if R is commutative. ![]() |
||
d. T = R. ![]() |
a. S must be commutative. ![]() |
||
b. The maximal ideal in S must be S. ![]() |
||
c. The kernel of any isomorphism is {0} in R. ![]() |
||
d. All of the above ![]() |
a. All of R ![]() |
||
b. The maximal ideal in R ![]() |
||
c. I ![]() |
||
d. {0} ![]() |
a. A field has no zero divisors. ![]() |
||
b. A division ring has no unity. ![]() |
||
c. A division ring has no unity. ![]() |
||
d. A division ring may have non-zero elements that have no inverses under multiplication. ![]() |
a. It is always a field. ![]() |
||
b. It is a commutative ring R with unity such that for every a, b in R, if ab = 0, then a or b = 0. ![]() |
||
c. It is a non-commutative ring with unity. ![]() |
||
d. It is a ring R such that for every a in R, with a not equal to zero, a multiplicative inverse exists. ![]() |
a. Every ring has two trivial ideals. ![]() |
||
b. Every ideal is homomorphic to a non-commutative subgroup. ![]() |
||
c. Every ideal is finite. ![]() |
||
d. Every ring cannot have any ideals unless the ring is commutative. ![]() |
a. They must be onto. ![]() |
||
b. The kernel of the homomorphism must be an ideal in the domain. ![]() |
||
c. The range of the homomorphism must be commutative. ![]() |
||
d. A ring homomorphism may only be one-to-one to be an isomorphism. ![]() |
a. Non-commutative rings ![]() |
||
b. Integral domains ![]() |
||
c. UFDs ![]() |
||
d. Modules ![]() |
a. A ring with a zero divisor can never be an integral domain. ![]() |
||
b. A ring with a zero divisor may be an integral domain if it is commutative. ![]() |
||
c. A ring with a zero divisor is a UFD. ![]() |
||
d. A ring with a zero divisor is a prime ideal. ![]() |
a. All rings are commutative groups under some defined operation of “addition.” ![]() |
||
b. All rings are commutative under some defined operation of “multiplication.” ![]() |
||
c. Rings only have subsets that are distributive under addition and multiplication. ![]() |
||
d. No ring is isomorphic to a field of the same order. ![]() |
a. It must always be commutative under multiplication. ![]() |
||
b. It must always be of finite order. ![]() |
||
c. It may not have an identity element under multiplication. ![]() |
||
d. The additive and multiplicative identities are not the same element. ![]() |
a. A subring of a commutative ring must itself be commutative. ![]() |
||
b. A subring of a commutative ring may not be commutative. ![]() |
||
c. A subring of a commutative ring may not be associative under multiplication. ![]() |
||
d. A subring of a commutative ring is always a prime ideal. ![]() |
a. The set of all 3x3 matrices under matrix addition and cross multiplication ![]() |
||
b. The set of integers under ordinary addition and multiplication ![]() |
||
c. The set of integers under ordinary multiplication and division ![]() |
||
d. None of the above ![]() |
a. Every element in E solves polynomials over F. ![]() |
||
b. Every element in E is also in F. ![]() |
||
c. E is C. ![]() |
||
d. None of the above ![]() |
a. [K:F][E:F] ![]() |
||
b. [K:E][E:F] ![]() |
||
c. 2[K:E] ![]() |
||
d. 2[K:F] ![]() |
a. Maximal subfield of E ![]() |
||
b. Base field of E ![]() |
||
c. Main field of E ![]() |
||
d. Indention field of E ![]() |
a. The maximum extension field of F ![]() |
||
b. The algebraic closure of F ![]() |
||
c. C ![]() |
||
d. An infinite extension of F ![]() |
a. R ![]() |
||
b. C ![]() |
||
c. Q(√3) ![]() |
||
d. Q(√3,√7) ![]() |
a. 15 ![]() |
||
b. 5 ![]() |
||
c. 3 ![]() |
||
d. 1 ![]() |
a. E can be thought of as a vector space. ![]() |
||
b. E must be an algebraic closure. ![]() |
||
c. E cannot be an extension of a smaller extension over F. ![]() |
||
d. All of the above ![]() |
a. E is a infinite field. ![]() |
||
b. [E:F]≤ n. ![]() |
||
c. [E:F] = n + 1. ![]() |
||
d. None of the above ![]() |
a. √2 ![]() |
||
b. √3 ![]() |
||
c. i ![]() |
||
d. 1 + i ![]() |
a. F = Q(-1+√2) ![]() |
||
b. F = Q(-1+√3) ![]() |
||
c. F = Q(-1+i√3) ![]() |
||
d. F = Q(-1+i√2) ![]() |
a. If K is a splitting field of p(x) and L is a splitting field of q(x), then θ extends to an isomorphism from K to L. ![]() |
||
b. F and E must have the same algebraic closures. ![]() |
||
c. 1 in F must be 0 in E. ![]() |
||
d. All of the above ![]() |
a. All square roots ![]() |
||
b. √6 ![]() |
||
c. ∛2 ![]() |
||
d. √3-√2 ![]() |
a. 2 ![]() |
||
b. 4 ![]() |
||
c. 6 ![]() |
||
d. 8 ![]() |
a. 35 ![]() |
||
b. 12 ![]() |
||
c. 7 ![]() |
||
d. 5 ![]() |
a. There is an extension field E for which any given polynomial in F has a solution. ![]() |
||
b. Every non-constant polynomial in F(x) has a solution in F. ![]() |
||
c. The only extension field of F that contains every solution of F(x) is C. ![]() |
||
d. F cannot be Q. ![]() |
a. Q(√2,√3) ![]() |
||
b. Q(√2,√6) ![]() |
||
c. Q(√3,√6) ![]() |
||
d. R is the smallest such field extension. ![]() |
a. K has to be an algebraic closure of F. ![]() |
||
b. A polynomial in F can be split into 9 unique factors. ![]() |
||
c. There are less than 9 total solutions to any polynomial over F. ![]() |
||
d. F must have order of 3. ![]() |
a. {√3,√6} ![]() |
||
b. {1, √2, √3,√6} ![]() |
||
c. {1, √3,√6} ![]() |
||
d. {√2} ![]() |
a. {1} ![]() |
||
b. {1,√3,√7} ![]() |
||
c. {√3,√7} ![]() |
||
d. {1,√3,√7,√21} ![]() |
a. 2 ![]() |
||
b. 3 ![]() |
||
c. 4 ![]() |
||
d. 6 ![]() |
a. Complex numbers ![]() |
||
b. Real numbers ![]() |
||
c. Rational numbers ![]() |
||
d. Integers ![]() |
a. C cannot be transcendental over Q ![]() |
||
b. All nth roots of integers are algebraic over Q ![]() |
||
c. Extension fields must be finite. ![]() |
||
d. All the above statements are true. ![]() |
a. If F is a finite extension over Q, it must be an algebraic extension of Q. ![]() |
||
b. If F is an infinite extension over Q, it can be a transcendental extension of Q. ![]() |
||
c. C is a transcendental extension over Q. ![]() |
||
d. All of the above statements are true. ![]() |
a. f(x)=x²+x+1 ![]() |
||
b. f(x)=x²+2x+1 ![]() |
||
c. f (x)=x²+2 ![]() |
||
d. f(x)=x²-2 ![]() |
a. If F is commutative ![]() |
||
b. If at least one solution to some polynomial over F is in E ![]() |
||
c. If E is C ![]() |
||
d. If C is E ![]() |