FINAL EXAM IN ABSTRACT ALGEBRA

BSED – 3 Math

Decide whether the statement is a theorem. If it is a theorem, prove it. If it is not, give
counterexample.

THEOREM Every even integer that is the square of an integer is an integral multiple of 4
Even integer: Any even integer has the form 2m. Its square,(2m)2 = 4m2, is even and, in fact,
divisible by 4.
Odd integer: Any odd integer has the form 2m + 1. Its square, (2m + 1)2 = 4m2 + 4m + 1 = 4(m2
+ m) + 1 = even + 1, is odd.
Hence, if a square number is even, it must be the square of an even number and so is
divisible by 4.

NOT a THEOREM If n is an nonnegative integer, then (n + 3)2 > 9

For example, 0 is nonnegative, but (0 + 3)2 = 9 6> 9.

NOT a THEOREM There exists a unique integer n such that n2 + 2 = 3

This is false. In fact, there are two integers that satisfy the condition: 1 2+2 = 3 and (−1)2 + 2 = 3.

THEOREM There exists one integer n such that r2 + 4 = 8

This is a theorem. Notice that 2 2 + 4 = 8, so n = 2 is one such integer. Of course, n = −2 also
works, but we only needed to show one.

THEOREM There exists an integer n such that n2 + 5 = 14

The theorem asserts the existence of an example, so if we give an example, we’ve proved the
statement. Notice that 32 + 5 = 14, so n = 3 works. [So does n = −3.]

NOT a THEOREM There exists just one integer n such that n2 + 5 = 14

This is false. There are at least two integers that satisfy n2 + 5 = 14. Notice that 32 + 5 = 14 and
(−3)2 + 5 = 14, so both n = 3 and n = −3 satisfy the condition. In fact, these are the only two
integers that work, but we only needed to show that there was more than one example.

THEOREM n2 > n for every integer n

THEOREM n2 > n for each negative integer n
NOT a THEOREM x2 < x for some real number x
THEOREM n2 > n for some integer n
THEOREM n2 = n for a unique integer n
Say that n = 1. The square of 1 is 1 and is equal to 1.
 NOT a THEOREM The square of every odd integer is more than the integral multiple of 4
THEOREM If n is more than an integral multiple of 3, then n2 is as well
THEOREM There exists an integer n such that n3 < n 𝑛 2 < 1
THEOREM Let n and m be integers such that n < m and m ≠ 0. Then ( )
𝑚

THEOREM Let n and m be integers such that n < m and m ≠ 0. Then (𝑛)2 ≤ 𝑛
𝑚 𝑚

THEOREM Let n and m be integers such that n < m and m ≠ 0. Then (𝑛)3 ≤ (𝑛)2
𝑚 𝑚

Mark each of the following true or false.

TRUE Every group G is isomorphic to a subgroup of S G’.
FALSE A group may have more than one identity element.
FALSE The proper attitude toward a definition is to memorize it so that you can reproduce it
word for word as in the text.
TRUE Every group is a binary algebraic structure.
FALSE Every permutation is a cycle.
FALSE A cyclic group has a unique generator.
FALSE Every function is a permutation if and only if it is one to one.
FALSE All generators of Z20 are prime numbers.
TRUE Any definition a person gives for a group is correct provided he or she can show that
everything that satisfies the definition satisfies the one in the text and conversely.
TRUE Every group is isomorphic to some group of permutations.
TRUE S7 is isomorphic to the subgroup of all those elements of S 8 that leave the number 5
fixed.
TRUE An equation of the form a*x*b = c always has a unique solution in a group.
FALSE Every set of numbers that is a group under addition is also a group under
multiplication.
TRUE Z4 is a cyclic group.
TRUE There is at least one abelian group of every finite order > 0.
TRUE Every element of a group generates a cyclic subgroup of the group.
FALSE A subgroup may be defined as a subset of a group.
FALSE Any definition a person gives for a group is correct provided that everything that is a
group by that person’s definition is also a group by the definition in the text.
TRUE Every permutation is a one-to-one function.
FALSE The symmetric group S10 has 10 elements.
TRUE Every cycle is a permutation.
FALSE Every subset of a group is a subgroup under the induced operation.
TRUE In a group, each linear equation has a solution.
FALSE In every cyclic group, every element is a generator.
FALSE The empty set can be considered a group.
FALSE Every cyclic group is abelian.
FALSE There may be a group in which the cancellation law fails.
FALSE Every abelian group is a cyclic.
TRUE Every function from a finite set onto itself must be one to one.
TRUE The associative law holds in every group.