[SOLVED] CS201 Midsem

30.00 $

Category: Tags: , ,
Click Category Button to View Your Next Assignment | Homework

You will receive the following solution file(s) instantly after successful payment:

zip file icon Midsem-j3zucg.zip (1046.8 KB)
Assignment Instructions Updated Recently? Submit Below and we will provide new Solution!
Submit New Instructions
🔒 Securely Powered by:
Secure Checkout
Rate this product

Question 1.  For any number ` > 0 prove that

,

where g(X) is a polynomial of degree less than `. Using the above, prove that for any numbers k and `, and for any polynomial f of degree at most `,

.

Question 2. ( Derive the number of primes less than 400 using the principle of

Inclusion-Exclusion.

Question 3.  Given a set A, a Z-module is defined to be a set whose elements have the form α = X caa

aA

where ca ∈ Z, the set of integers. It is denoted as Z(A). One can define addition of elements in Z(A) naturally:

α + β = X caa + X daa = X(ca + da)a.

aA                      aA                       aA

A proper subset B ⊂ Z(A) is called a submodule if B is closed under addition, that is, if α,β B then α + β B. A submodule B is maximal if there is no submodule that properly contains B. Prove that Z(A) has a maximal submodule.

1

  • Midsem-j3zucg.zip