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.
€44.03
भाषा अंग्रेज़ी ● स्वरूप PDF ● ISBN 9783540696773 ● प्रकाशक Springer Berlin Heidelberg ● प्रकाशित 2006 ● डाउनलोड करने योग्य 3 बार ● मुद्रा EUR ● आईडी 6319817 ● कॉपी सुरक्षा Adobe DRM
एक DRM सक्षम ईबुक रीडर की आवश्यकता है
एक ही लेखक से अधिक ईबुक / संपादक
47,429 इस श्रेणी में ईबुक
