Solving problems in higher mathematics

Employer
[no-member:pro]Aleksey[/no-member:pro]Aleksey
Project parameters
Type of cooperationOne-time project
SectionEducation and consulting
Prepaymentwithout prepayment
Payment methodsBank transfer
Acceptance of requestsclosed
Project description
We need a specialist in solving problems in higher mathematics. It is necessary to solve problems in higher mathematics.
1. Find the number of different forming elements in groups:
(a)(Z12,+); (b) (Z12*, .); (c) (Z19*, . ).
(.- means multiplication operation).
2. Find the maximum possible order of the element in the group:
A) S11; b) S9.
3. Find the number of different cyclic subgroups of maximum order in the groups: (a) S11; (b) S9.
4. Let F2[x]/(gi(x)- where the polynomial gi(x) is:
g1 =(10011011), g2 =(11110101), g3 =(10111001)
(Percentages are defined by their coefficients, coefficients, and
The higher degrees are on the left.
(a) Determine which rings are fields.
(b) Indicate the number of primitive elements in the
Fields.
(c) Remove element [x3] in the resulting fields.
5. Combinatorics:
How many ways are there to throw 6 distinguishable bones so that no more than three of them get the same number of points?
B) How many ways can 5 cards be drawn from a deck of 52 cards so that there are no more than 2 cards?
1. Find the number of different forming elements in groups:
(a)(Z12,+); (b) (Z12*, .); (c) (Z19*, . ).
(.- means multiplication operation).
2. Find the maximum possible order of the element in the group:
A) S11; b) S9.
3. Find the number of different cyclic subgroups of maximum order in the groups: (a) S11; (b) S9.
4. Let F2[x]/(gi(x)- where the polynomial gi(x) is:
g1 =(10011011), g2 =(11110101), g3 =(10111001)
(Percentages are defined by their coefficients, coefficients, and
The higher degrees are on the left.
(a) Determine which rings are fields.
(b) Indicate the number of primitive elements in the
Fields.
(c) Remove element [x3] in the resulting fields.
5. Combinatorics:
How many ways are there to throw 6 distinguishable bones so that no more than three of them get the same number of points?
B) How many ways can 5 cards be drawn from a deck of 52 cards so that there are no more than 2 cards?