Scribd
Upload
75 views1 page

Seminar 9

This document discusses formal power series and polynomials over commutative rings. It covers topics such as: - Determining whether a power series is a unit or nilpotent element based on the coefficients - Computing inverses and power series expansions of functions - Proving identities involving formal power series - Generating functions for sequences like Fibonacci numbers and Catalan numbers - Irreducible polynomials over finite fields

Uploaded by

mchis687905
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
75 views1 page

Seminar 9

This document discusses formal power series and polynomials over commutative rings. It covers topics such as: - Determining whether a power series is a unit or nilpotent element based on the coefficients - Computing inverses and power series expansions of functions - Proving identities involving formal power series - Generating functions for sequences like Fibonacci numbers and Catalan numbers - Irreducible polynomials over finite fields

Uploaded by

mchis687905
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

9 Formal power series and Polynomials

∞
an X n , show that
P
P. 9.1. Let (R, +, ·) be a commutative unital ring. If f =
n=0

f ∈ U (R[[X]]) ⇐⇒ a0 ∈ U (R) .

P. 9.2. Compute the inverse of the series 1 − X ∈ R[[X]].


 
1 1 1 1+x
P. 9.3. Determine the power series expansions of the functions 1−x , 1+x , (1−x)2 , ln(1 + x), ln 1−x ,
1
1+x2 , arctg(x).
P. 9.4. Show that
(−1)n−1
a) ln(2) = 1 − 21 + 1
3 − 1
4 + ... + n + ...
π 1 1 1 (−1)n−1
b) 4 =1− 3 + 5 − 7 + ... + 2n−1 + . . .

P. 9.5. Prove the identities:


n
a) (1 + X)(1 + X 2 )(1 + X 4 ) . . . (1 + X 2 ) . . . = 1 + X + X 2 + X 3 + . . . + X n + . . .
n n n
b) (1 + X + X 2 + . . . + X 9 )(1 + X 10 + X 20 + . . . + X 90 ) . . . (1 + X 10 + X 2·10 + . . . + X 9·10 ) . . . =
1 + X + X2 + X3 + . . . + Xn + . . .
P. 9.6. a) Prove the identity
1 1 1 1
(1 + X)(1 + X 2 )(1 + X 3 ) . . . (1 + X n ) . . . = · · · ... · ···...
1 − X 1 − X3 1 − X5 1 − X 2n−1
b) Let n ∈ N∗ be an arbitrary positive integer. Show that the number of ways in which n can be written
as a sum of distinct positive integers equals the number of ways in which n can be written as a sum of
odd positive integers(not necessarilly distinct).

P. 9.7. Determine the generating function for the sequence of Fibonacci numbers, defined by the relations

F0 = 0 , F1 = 1 , Fn = Fn−1 + Fn−2 , (∀)n ∈ N, n ≥ 2 .

P. 9.8. Determine the generating function for the sequence of Catalan numbers, defined by the relations

T0 = 0 , T1 = 1 , Tn = T1 · Tn−1 + T2 · Tn−2 + . . . + Tn−1 · T1 , (∀)n ∈ N, n ≥ 2 .

P. 9.9. Let (R, +, ·) be a commutative unital ring and f = a0 + a1 X + . . . + an X n ∈ R[X]. Show that

f ∈ N (R[X]) ⇐⇒ a0 , a1 , . . . , an ∈ N (R) .

P. 9.10. Let (R, +, ·) be a commutative unital ring and f = a0 + a1 X + . . . + an X n ∈ R[X]. Show that

f ∈ U (R[X]) ⇐⇒ a0 ∈ U (R), a1 , . . . , an ∈ N (R) .

P. 9.11. If (R, +, ·) is an entire ring, show that U (R[X]) = U (R).


P. 9.12. If (K, +, ·) is a field, show that U (K[X]) = K \ {0}.

P. 9.13. Let (R, +, ·) be a commutative unital ring with N (R) = 0, and f = a0 +a1 X+. . .+an X n ∈ R[X].
Show that
f ∈ D(R[X]) ⇐⇒ (∃)b ∈ R \ {0} : ai · b = 0, (∀)i = 0, n .
P. 9.14. Determine the irreducible polynomials of degree less or equal than 5 in Z2 [X].
P. 9.15. Determine the monic irreducible polynomials of degree less or equal than 3 in Z3 [X].

You might also like