--%>

Examples of groups

Examples of groups: We now start to survey a wide range of examples of groups (labelled by (A), (B), (C), . . . ). Most of these come from number theory. In all cases, the group axioms should be checked. This is easy for almost all of the examples, and will be left as an exercise except in the occasional more difficult or subtle case.

(A) Our first examples are groups of numbers under addition. To begin, each of the sets Z (the integers), Q (the rational numbers), R (the real numbers) and C (the complex numbers) forms a group under the binary operation + of addition (exercise). Clearly, the groups are all abelian.

(B) For any fixed n ≡ Z, the set nZ = {na : a ≡ Z} is a subgroup of Z (exercise). A few speci fic cases are:

0Z = {0};
1Z = ( -1)Z = Z;
2Z = ( -2)Z = {2a : a ≡ Z}
= the set of even integers:

   Related Questions in Mathematics

  • Q : Who derived the Black–Scholes Equation

    Who derived the Black–Scholes Equation?

  • Q : Budgeted cash disbursements The ABC

    The ABC Company, a merchandising firm, has budgeted its action for December according to the following information: • Sales at $560,000, all for cash. • The invoice cost for goods purc

  • Q : Where would we be without stochastic

    Where would we be without stochastic or Ito^ calculus?

  • Q : Define terms Terms : Terms are defined

    Terms: Terms are defined inductively by the following clauses.               (i) Every individual variable and every individual constant is a term. (Such a term is called atom

  • Q : Problem on Linear equations Anny, Betti

    Anny, Betti and Karol went to their local produce store to bpought some fruit. Anny bought 1 pound of apples and 2 pounds of bananas and paid $2.11.  Betti bought 2 pounds of apples and 1 pound of grapes and paid $4.06.  Karol bought 1 pound of bananas and 2

  • Q : Explain the work and model proposed by

    Explain the work and model proposed by Richardson.

  • Q : Formal logic2 It's a problem set, they

    It's a problem set, they are attached. it's related to Sider's book which is "Logic to philosophy" I attached the book too. I need it on feb22 but feb23 still work

  • Q : Pig Game Using the PairOfDice class

    Using the PairOfDice class design and implement a class to play a game called Pig. In this game the user competes against the computer. On each turn the player rolls a pair of dice and adds up his or her points. Whoever reaches 100 points first, wins. If a player rolls a 1, he or she loses all point

  • Q : State Measuring complexity Measuring

    Measuring complexity: Many algorithms have an integer n, or two integers m and n, as input - e.g., addition, multiplication, exponentiation, factorisation and primality testing. When we want to describe or analyse the `easiness' or `hardness' of the a

  • Q : State Prime number theorem Prime number

    Prime number theorem: A big deal is known about the distribution of prime numbers and of the prime factors of a typical number. Most of the mathematics, although, is deep: while the results are often not too hard to state, the proofs are often diffic