Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

Doron Zeilberger, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu
Bryan Ek, Rutgers University, bryan [dot] t [dot] ek {at} math [dot] rutgers [dot] edu

Title: Three (No, Two) Lovely Problems from OEIS

Speaker: Neil Sloane, The OEIS Foundation and Rutgers University

Date: Thursday, October 5, 2017 5:00pm

Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ


I'll discuss problems from geometry, number theory, and the theory of computing.

(i) Poonen and Rubinstein famously counted the intersection points in a regular n-gon with all diagonals drawn. But what if we start with n points on a line rather than a circle? (A6561, A290447).

(ii) Mysterious things happen when you iterate arithmetic functions, for example n -> (φ(n)+σ(n))/2. Although it is hard to believe, the orbit of 270 seems to be integral and ever-increasing (A291789). John Conway recently lost a $1000 wager on the iteration of another arithmetic function (A195264).

(iii) Back in the 1930s Emil Post studied "tag systems", which in general are now known to be universal Turing machines. However, Post's simple 3-shift tag system is still open, 80 years later. In the last month there has been some progress, but this is ongoing work and the topic will be postponed until a later talk.

See: http://sites.math.rutgers.edu/~bte14/expmath/