Collatz-type problems with multiple divisors
The Collatz Conjecture hypothesizes that if a sequence of integers beginning with any positive integer t₀ is recursively defined so that t_j₊₁ = (t_j)/2 when t_j is even and t_j₊₁ = 3(t_j)+1 when t_j is odd, then there will be some j in the set of natural numbers such that t_j = 1. I propose a s...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
University of British Columbia
2009
|
| Online Access: | http://hdl.handle.net/2429/12614 |