![savannahvargas512](/avatars/40792.jpg)
savannahvargas512
27.06.2019 •
Mathematics
Prove that u(n) is a group under the operation of multiplication modulo n.
Solved
Show answers
More tips
- D Dating, Love, Relationships How Long Can Love Last?...
- A Auto and Moto Mastering One-Movement Parking: All You Need to Know...
- C Computers and Internet How to Properly Order Clothing from International Online Stores...
- H Health and Medicine Headache: A Comprehensive Guide to Treatment...
- F Family and Home How to Choose the Best Diapers for Your Baby?...
- A Auto and Moto Discovering the Leader: What is the Most Expensive Car in the World?...
- F Food and Cooking How to Quickly Put your Child to Sleep?...
- C Computers and Internet How to Create a Website for Free and Easy?...
- F Family and Home Parquet or laminate, which is better?...
- H Health and Medicine Coughing: Causes, Types, and Treatment Methods...
Answers on questions: Mathematics
- M Mathematics Say something funny or send a funny photo...
- M Mathematics yes, i can smile yes, i can look happy yes, i can sound happy. that doesn t prove that i m not broke inside....
- M Mathematics Which function is represented by the graph?...
- B Biology State TWO ways in which the mating call of the new isolated southern frog population differs from the north population of frogs.(2)Suggest why the new isolated southern...
- B Biology Una carga de 50 N unida a un resorte que cuelga verticalmente estira el resorte 5cm. El resorte se coloca ahora horizontalmente sobre una masa y se estira 11cm....
- S Social Studies Can someone help me please...
Ответ:
The answer is the proof so it is long.
The question doesn't define u(n), but it's not hard to guess.
Group G with operation ∘
For all a and b and c in G:
1) identity: e ∈ G, e∘a = a∘e = a,
2) inverse: a' ∈ G, a∘a' = a'∘a = e,
3) closed: a∘b ∈ G,
4) associative: (a∘b)∘c = a∘(b∘c),
5) (optional) commutative: a∘b = b∘a.
Define group u(n) for n prime is the set of integers 0 < i < n with operation multiplication modulo n.
If n isn't prime, we exclude from the group all integers which share factors with n.
Identity: e = 1. Clearly 1∘a = a∘1 = a. (a is already < n).
Closed: u(n) is closed for n prime. We must show that for all a, b ∈ u(n), the integer product ab is not divisible by n, so that ab ≢ 0 (mod n). Since n is prime, ab ≠ n. Since a < n, b < n, no factors of ab can equal prime n. (If n isn't prime, we already excluded from u(n) all integers sharing factors with n).
Inverse: for all a ∈ u(n), there is a' ∈ u(n) with a∘a' = 1. To find a', we apply Euclid's algorithm and write 1 as a linear combination of n and a. The coefficient of a is a' < n.
Associative and Commutative:
(a∘b)∘c = a∘(b∘c) because (ab)c = a(bc)
a∘b = b∘a because ab = ba.
Ответ:
Step-by-step explanation:
The perimeter of a parallelogram is the sum of all sides, but this figure has two pair sides that are equal. So, from its definition we deduct that
and
.
So, the perimeter would be:
Therefore, the correct answer is the second option. The final expression of the perimeter cannot be added because they don't have similar roots that allow us to sum them.