| a. 18 | ||
| b. 24 | ||
| c. 7 | ||
| d. 3 |
| a. 7 | ||
| b. 12 | ||
| c. 24 | ||
| d. 1 |
| a. G is cyclic. | ||
| b. G has a nontrivial center. | ||
| c. G is isomorphic to S4 | ||
| d. G has no proper subgroups. |
| a. G's center must be order 5 or 25. | ||
| b. G has no trivial center. | ||
| c. G is cyclic. | ||
| d. G has no proper subgroups. |
| a. G cannot be its own center. | ||
| b. G cannot be cyclic. | ||
| c. G must have order 11 or order 121. | ||
| d. None of the above |
| a. 15 | ||
| b. 7 | ||
| c. 1024 | ||
| d. 371 |
| a. G must contain a proper subgroup H of order 49. | ||
| b. G must be abelian. | ||
| c. G cannot contain a nontrivial center. | ||
| d. G must be cyclic. |
| a. 36 | ||
| b. 9 | ||
| c. 15 | ||
| d. 4 |
| a. Z18XZ15 | ||
| b. Z10XZ9XZ3 | ||
| c. Z2XZ27XZ5 | ||
| d. Z6XZ9XZ5 |
| a. 3 | ||
| b. 13 | ||
| c. 39 | ||
| d. G cannot have a proper, nontrivial subgroup. |
| a. 3 | ||
| b. 13 | ||
| c. 39 | ||
| d. G cannot have a proper, nontrivial subgroup. |
| a. G has a prime order. | ||
| b. G can only be {e}. | ||
| c. G can only be an infinite group. | ||
| d. G cannot have cosets. |
| a. The order of H ∩ J must divide the order of G. | ||
| b. H ∪ J = G. | ||
| c. H has no nontrivial subgroups. | ||
| d. J only has a trivial subgroup if H has one. |
| a. 21 | ||
| b. 7 | ||
| c. 3 | ||
| d. 1 |
| a. 1 | ||
| b. 5 | ||
| c. 11 | ||
| d. 55 |
| a. G will not have a subgroup of order 15. | ||
| b. G cannot have a subgroup of order 3. | ||
| c. G may not have a subgroup of order 30. | ||
| d. G may have a normal subgroup of order 27. |
| a. 1 | ||
| b. 7 | ||
| c. 13 | ||
| d. 91 |
| a. 5 | ||
| b. 19 | ||
| c. 95 | ||
| d. 190 |
| a. K has to be {e}. | ||
| b. K has to have an order of 2. | ||
| c. K has to have an order of 2n, where n ≤ 10. | ||
| d. K has to be G. |
| a. G must be abelian | ||
| b. H must be {e} | ||
| c. H must be G | ||
| d. H must be normal |
| a. {e} | ||
| b. {a, e} | ||
| c. {a, c, e} | ||
| d. G |
| a. 5 | ||
| b. 25 | ||
| c. 125 | ||
| d. 625 |
| a. G has to have a prime order. | ||
| b. G cannot be abelian. | ||
| c. G has to have order of 1. | ||
| d. G has to be empty. |
| a. G is not abelian. | ||
| b. G has order 84. | ||
| c. G may have subgroups of order 3 and 4. | ||
| d. All of the above |
| a. 1 | ||
| b. 1,2 | ||
| c. 1,2,5 | ||
| d. 1,2,5,10 |
| a. 20x4 + 7x3 + 42x2 + 23x - 36 | ||
| b. 9x2 + 2x + 5 | ||
| c. 8x4 + 7x3 + 6x2 + 9x | ||
| d. x2 - 4x - 13 |
| a. Unique factorization ring | ||
| b. Ideal | ||
| c. Integral domain | ||
| d. Module |
| a. b might be equal to any multiple of 3. | ||
| b. b must equal 0. | ||
| c. b cannot be a multiple of 3. | ||
| d. b must be the multiplicative inverse of 3. |
| a. f(x) is a zero divisor. | ||
| b. f(x) = either p(x) or q(x). | ||
| c. f(x) | p(x) or f(x) | q(x) | ||
| d. f(x) = p(x)q(x). |
| a. r(x) must be the zero polynomial. | ||
| b. deg r(x) must be less than deg q(x). | ||
| c. r(x) must be irreducible. | ||
| d. deg r(x) must be zero. |
| a. p and q cannot have the same degrees. | ||
| b. p and q MUST have the same degrees. | ||
| c. The degrees of p and q must be smaller than the degree of f. | ||
| d. f must be a monic polynomial. |
| a. f(x) is irreducible. | ||
| b. f(x) must have a unique factorization. | ||
| c. f(x) is either irreducible or factorable. | ||
| d. f(x) is a constant polynomial. |
| a. F is a unique factorization domain. | ||
| b. F must be a field. | ||
| c. F must be a module. | ||
| d. F must be a commutative ring. |
| 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. 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. UFD | ||
| b. Field | ||
| c. Prime ideal | ||
| d. Integral domain |
| a. It can never be an integral domain. | ||
| b. It may be an integral domain if it is commutative. | ||
| c. It is a UFD. | ||
| d. It is a prime ideal. |
| a. A field has no zero divisors. | ||
| b. A division ring has no unity. | ||
| c. A division ring may have non-zero elements that have no inverses under multiplication. |
| a. Finite | ||
| b. A non-trivial ideal | ||
| c. Commutative | ||
| d. A field |
| a. Each element is divisible by all the elements less than itself. | ||
| b. Each element is equal to all other elements in L. | ||
| c. L has a partial order defined on it. | ||
| d. L has to be a Boolean algebra. |
| a. Boolean algebras are ring-like structures that form incomplete lattices. | ||
| b. Boolean algebras are ring-like structures that have no zero elements. | ||
| c. Boolean algebras are ring-like structures that use both set and logic operations. | ||
| d. Boolean algebras are ring-like structures that have no unique upper and lower bounds. |
| a. A partial ordering of the unique divisors of 18 | ||
| b. A random walk between points 1 and 18 | ||
| c. A process map of steps in a program, where numbers represent called subroutines | ||
| d. All of the above |
| a. Represent complex circuitry | ||
| b. Assist in finding exploits in a computer network | ||
| c. Represent physical security layouts | ||
| d. Locate trends in a social network |
| a. A module | ||
| b. A partially ordered set | ||
| c. An invertible matrix | ||
| d. A Boolean algebra |
| a. The degree of the factor must be less than n. | ||
| b. The degree of the factor must be 0. | ||
| c. The degree of the factor must be 1. | ||
| d. The degree of the factor must divide n evenly. |
| a. deg f(x) = 1. | ||
| b. deg f(x) = 0. | ||
| c. deg f(x) = jk. | ||
| d. There is not enough information given to determine the answer. |
| a. Transitive | ||
| b. Reflexive | ||
| c. Antisymetric | ||
| d. Symmetric |
| a. 6 | ||
| b. 12 | ||
| c. 24 | ||
| d. There is no least upper bound. |
| a. Invertible | ||
| b. Commutative | ||
| c. Complemented | ||
| d. Associative |
| a. Power set of some random set X | ||
| b. Any finite group | ||
| c. A group with a prime order | ||
| d. Any commutative ring |
| a. n-tuples | ||
| b. n-dimensional arrays | ||
| c. Power set of any n elements | ||
| d. Set of all permutations of any n elements |
| a. A vector space is a non-abelian ring made up of n-tuples. | ||
| b. A vector spaces is an abelian ring made up of n-tuples. | ||
| c. A vector space is a non-abelian group extended by scalar multiplication. | ||
| d. A vector spaces is an abelian group extended by scalar multiplication. |
| a. Scalar, scalar | ||
| b. Vector, vector | ||
| c. Scalar, vector | ||
| d. Vector, scalar |
| a. V's combination class | ||
| b. V's spanning set | ||
| c. V's linear representation | ||
| d. V's rank |
| a. Independent | ||
| b. Combined | ||
| c. Dependent | ||
| d. Represented |
| a. Representation | ||
| b. Projection | ||
| c. Basis | ||
| d. Linear combination |
| a. Status | ||
| b. Basis | ||
| c. Identification | ||
| d. Projection |
| a. M is nonsingular. | ||
| b. M has a 0 determinant. | ||
| c. M has rank less than n. | ||
| d. M cannot be reduced to I by row operations. |
| a. A 3 X 3 matrix | ||
| b. A 4 X 5 matrix | ||
| c. A 15 X 12 matrix | ||
| d. A 5 X 4 matrix |
| a. A power set | ||
| b. An abelian group | ||
| c. A projection | ||
| d. A matrix |
| a. Less than | ||
| b. Greater than | ||
| c. Equal to | ||
| d. At least one less than |
| a. A lattice of n partially ordered elements | ||
| b. An invertible nxn matrix | ||
| c. Any nxn matrix | ||
| d. A pair of n-tuples |
| a. Scalar | ||
| b. Single vector | ||
| c. Linear map | ||
| d. Non-reversible projection |
| a. Range space | ||
| b. Null space | ||
| c. Domain | ||
| d. Projection space |
| a. The dimension of its rank | ||
| b. The dimension of its nullity | ||
| c. The sum of its rank and nullity | ||
| d. None of the above |
| a. Unity | ||
| b. Zero | ||
| c. Largest | ||
| d. Smallest |
| a. Exactly zero | ||
| b. Exactly one | ||
| c. The multiplicative identity vector | ||
| d. The rank of the map's codomain |
| a. An invertible matrix | ||
| b. A singular matrix | ||
| c. A non-trivial nullity | ||
| d. rank less than the domain |
| a. It is always onto and one-to-one. | ||
| b. It is always onto but not necessarily one-to-one. | ||
| c. It is always one-to-one but not necessarily onto. | ||
| d. It is not always one-to-one nor onto. |
| a. A linear map | ||
| b. An isomorphism | ||
| c. A projective map | ||
| d. A change of representation |
| a. A non-trivial kernel in another | ||
| b. The zero vector of another | ||
| c. The multiplicative identity of another | ||
| d. The entire span of another |
| a. Rank | ||
| b. Identity | ||
| c. Structure | ||
| d. All of the above |
| a. An isomorphism is a type of equivalence relation. | ||
| b. An isomorphism is a type of lattice. | ||
| c. An isomorphism is a type of Boolean algebra. | ||
| d. An isomorphism is a type of non-invertible function. |
| a. A self-projection | ||
| b. A reversible map | ||
| c. A power map | ||
| d. An automorphism |
| a. A linear map between them | ||
| b. The same identity | ||
| c. The same dimension | ||
| d. The same kernel |
| a. Set addition | ||
| b. Composition of functions | ||
| c. Translations of axes | ||
| d. Matrix multiplication |
| a. The power set of E over F | ||
| b. The Galois group of E over F | ||
| c. The super group of E over F | ||
| d. The kernel of E over F |
| a. Automorphism | ||
| b. Bifurcation | ||
| c. Splitting field | ||
| d. Radial transformation |
| a. A permutation of the roots of f(x) that lie in E | ||
| b. A projection of the kernel of F in E | ||
| c. A bijection from all elements in E to all elements in F | ||
| d. None of the above |
| a. Galois | ||
| b. Projective | ||
| c. Normal | ||
| d. Power |
| a. F is a splitting field over E of a separable polynomial. | ||
| b. E is a Galois group of F. | ||
| c. F is a Galois group of E. | ||
| d. F = EG for some finite group of aut(E). |
| a. Galois group of E over F is infinite. | ||
| b. Galois group of E over F is abelian. | ||
| c. Galois group of E over F has order equal to F. | ||
| d. Galois group of E over F has a non-trivial center. |
| a. Simple root | ||
| b. Solitary root | ||
| c. Unitary root | ||
| d. Sole root |
| a. A simple element | ||
| b. A solitary element | ||
| c. A primitive element | ||
| d. A unitary element |
| a. Separable | ||
| b. Galois | ||
| c. Simple | ||
| d. Primitive |
| a. Fixes | ||
| b. Transposes | ||
| c. Translates | ||
| d. Rotates |
| a. Commutative ring | ||
| b. Abelian group | ||
| c. Extended group | ||
| d. Vector field |
| a. E = F(m) | ||
| b. F = E(m) | ||
| c. F = E | ||
| d. m = e(m) |
| a. Galois group | ||
| b. Communtator ring | ||
| c. Subfield | ||
| d. Noncommutative subring |
| a. Fixed | ||
| b. Separable | ||
| c. Simple | ||
| d. Complex |
| a. f(x) is separable. | ||
| b. f(x) is a linear transformation. | ||
| c. f(x) is the kernel of F. | ||
| d. f(x) is an element of the automorphism of an extension field of F. |
| a. Extension | ||
| b. Splitting | ||
| c. Fixed | ||
| d. Embedded |
| a. A general extension field | ||
| b. A fixed field | ||
| c. A power set | ||
| d. A symmetric group |
| a. Separable extension | ||
| b. Prime ideal | ||
| c. Quotient ring | ||
| d. Galois group |
| a. Trivial | ||
| b. Non-trivial | ||
| c. Normal | ||
| d. Extended |
| a. 0 | ||
| b. 1 | ||
| c. 2 | ||
| d. 3 |
| a. Simple | ||
| b. Complex | ||
| c. Separable | ||
| d. F's extension field |
| a. Monic | ||
| b. Separable | ||
| c. Simple | ||
| d. Algebraic |
| a. Separable | ||
| b. Primitive | ||
| c. Solvable | ||
| d. Monic |
| a. Permutation | ||
| b. Power | ||
| c. Partially ordered | ||
| d. Separable |