Math 480, Spring 2015, Assignment 12

From cartan.math.umb.edu


Carefully define the following terms:

  1. $L(X)$.

Carefully state the following theorems (you do not need to prove them):

  1. Expected time complexity for the relation-building stage of Dickson's method.

Carefully describe the following algorithms:

  1. Quadratic sieve.

Solve the following problems:

  1. Problem 3.33.
--------------------End of assignment--------------------

Questions:

Solutions: