*4. prove the following: if (g, *, e) is a finite group with even order, then there exists g fe in g such that g*g=e.

As (G, *, e) is a group with 2n elements, we have 2n-1 elements different from e. Let us assume that there aren't elements of (G, *, e) such that g*g=e. Now, take pairs of elements of (G, *, e) as , i.e., let us associate each element (different from e) with its multiplicative inverse. Let us remark that we are making no distinction between and , because they essentially the same pair.

Now, how many different pairs can we form with 2n-1 elements? Only n-1, which give us 2n-2 elements. Then, there is a ‘‘missing’’ element of that list. That element must fulfill that g*g=e, because it cannot be paired with any other element.

idk

step-by-step explanation:

maybe try   if it is work from a book, if not try

the ratio of white tiles to blue tiles is 48: 16. the ratio in it's simplest form is 3: 1.

step-by-step explanation:

ratio: take the first number and add a colon next to it, then add the second number after that. make sure the ratio order matches up with the written problem!

simplest form: we can simplify the ratio 48 : 16 by dividing both terms by the greatest common factor (gcf).

the gcf of 48 and 16 is 16.

divide both terms by 16:

48 ÷ 16 = 3

16 ÷ 16 = 1

reducing to simplest form:

48 : 16 = 3 : 1