These are the Extra, spur-of-the-moment problems that we (any of us) come
    up with in our Number Theory class.

    Isaac and Amos keep track of the problems.  I adjoin them to a text file
    which is linked from our course page

    http://math.ufl.edu/~squash/course.numt2.2006t.html

    As of 05Sep2006:

================================================================
E1: (Abbreviated: Needs info from class) Give a complete description of
the Floyd cycle-finding algorithm.  Using C to denote the cycle-length,
and T for the length of the tail, give an O(C+T) algorithm ["big O" of
C+T]

to find: C, T, and the  first-position in the orbit that  is in the loop.

================================================================

Let /A be the set    3|N + 1 of "Aaron numbers" (those posints who mod-3
residue is 1).

E2:  What can you say abouts Primes(/A)?

E3:  What can you say abouts Irred(/A)?

E4:  Give an infinite subset G of the integers which has 1 and is sealed
under multiplication and negation.  Furthermore, there are G-irreducibles
that are not G-prime.

  I.e, get an example like the Aaron numbers, but which is sealed under
  negation.

================================================================