- UNSW
- ...
- Our schools
- Mathematics & Statistics
- Engage with us
- Seminars
- 2018
- The Collatz 3n+1 problem
Science
Mathematics and Statistics
- Home
- Our school
- Study with us
- Our research
-
Student life & resources
- Undergraduate
- Honours year
- Postgraduate coursework
-
Postgraduate research
- Info for new students
- Current research students
- Postgraduate conference
- Postgraduate events
- Postgraduate student awards
- Michael Tallis PhD Research Travel Award
- Information about research theses
- Past research students
- Resources
- Entry requirements
- PhD projects
- Obtaining funding
- Application & fee information
-
Student services
- Help for postgraduate students
- Thesis guidelines
- School assessment policies
- Computing information
- Mathematics Drop-in Centre
- Consultation
- Statistics Consultation Service
- Academic advice
- Enrolment variation
- Changing tutorials
- Illness or misadventure
- Application form for existing casual tutors
- ARC grants Head of School sign off
- Computing facilities
- Choosing your major
- Student societies
- Student noticeboard
- Casual tutors
- Engage with us
- News & events
- Contact
- Home
- Our school
- Study with us
- Our research
-
Student life & resources
Postgraduate research
- Info for new students
- Current research students
- Postgraduate conference
- Postgraduate events
- Postgraduate student awards
- Michael Tallis PhD Research Travel Award
- Information about research theses
- Past research students
- Resources
- Entry requirements
- PhD projects
- Obtaining funding
- Application & fee information
Student services
- Help for postgraduate students
- Thesis guidelines
- School assessment policies
- Computing information
- Mathematics Drop-in Centre
- Consultation
- Statistics Consultation Service
- Academic advice
- Enrolment variation
- Changing tutorials
- Illness or misadventure
- Application form for existing casual tutors
- ARC grants Head of School sign off
- Computing facilities
- Choosing your major
- Engage with us
- News & events
- Contact
Abstract:
A positive integer a0a0 determines recursively the sequencea0,a1,a2,…a0,a1,a2,… by the Collatz rules an+1=an/2an+1=an/2 for even nn and an+1=(3an+1)an+1=(3an+1) fornn odd. Massive electronic calculation over many years has verified that for each`start' a0a0 examined there is an n≥0n≥0 with an=1an=1 and so an+3=1an+3=1, etc. Theauthor's experience in using modern computers to understand WW2 cryptology hasbeen used to find a new phenomenon in this context.
Speaker
Peter Donovan
Research Area
Pure Maths Seminar
Affiliation
University of New South Wales
Date
Tue, 17/04/2018 - 12:00pm to 1:00pm
Venue
RC-4082, The Red Centre, UNSW