MA 522 Fall 2008 Homework 3: Implementing Algorithms in MAPLE - Prof. Agnes Szanto, Assignments of Mathematics

A university homework assignment for a mathematics course (ma 522) from the fall 2008 semester. The assignment includes several problems related to pseudo-code for division with remainder, the extended euclidean algorithm for univariate polynomials over the field zp using maple, and extra credit problems. Students are required to submit their answers as maple worksheets.

Typology: Assignments

Pre 2010

Uploaded on 03/10/2009

koofers-user-wfy
koofers-user-wfy 🇺🇸

9 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Homework 3
MA 522 Fall 2008
1. (20 points) Write a pseudo-code for the division with remainder algorithm over Z
2. (40 points) Textbook, page 40/ 2.10 (i) and (iii)
3. Your answers for this problem should be submitted as a MAPLE worksheet (by email),
including your implementation and the output of the examples in part (b).
(a) (20 points) Implement in MAPLE the Extended Euclidean Algorithm for Zp[x], i.e. for
univariate polynomials over the field Zp={0,1, . . . , p 1}where pis an arbitrary prime
number. Use MAPLE’s datastructure for polynomials and its modular arithmetics.
(b) (20 points) Textbook, page 59/ 3.14
4. Extra credit problem (20 points) Textbook, page 60/ 3.25 (ii) and (iii)
1

Partial preview of the text

Download MA 522 Fall 2008 Homework 3: Implementing Algorithms in MAPLE - Prof. Agnes Szanto and more Assignments Mathematics in PDF only on Docsity!

Homework 3

MA 522 Fall 2008

  1. (20 points) Write a pseudo-code for the division with remainder algorithm over Z
  2. (40 points) Textbook, page 40/ 2.10 (i) and (iii)
  3. Your answers for this problem should be submitted as a MAPLE worksheet (by email), including your implementation and the output of the examples in part (b).

(a) (20 points) Implement in MAPLE the Extended Euclidean Algorithm for Zp[x], i.e. for univariate polynomials over the field Zp = { 0 , 1 ,... , p − 1 } where p is an arbitrary prime number. Use MAPLE’s datastructure for polynomials and its modular arithmetics.

(b) (20 points) Textbook, page 59/ 3.

  1. Extra credit problem (20 points) Textbook, page 60/ 3.25 (ii) and (iii)