The 3n+1 function T is defined by T(n)=n/2 for n even, and T(n)=(3n+1)/2 for n odd. The famous 3n+1 conjecture, which remains open, states that, for any starting number n>0, iterated application of T to n eventually produces 1. After a survey of theorems concerning the 3n+1 problem, the main focus of the book are 3n+1 predecessor sets. These are analyzed using, e.g., elementary number theory, combinatorics, asymptotic analysis, and abstract measure theory. The book is written for any mathematician interested in the 3n+1 problem, and in the wealth of mathematical ideas employed to attack it.
Ngôn ngữ Anh ● định dạng PDF ● ISBN 9783540696773 ● Nhà xuất bản Springer Berlin Heidelberg ● Được phát hành 2006 ● Có thể tải xuống 3 lần ● Tiền tệ EUR ● TÔI 6319817 ● Sao chép bảo vệ Adobe DRM
Yêu cầu trình đọc ebook có khả năng DRM