Product Description
Chapters: P Versus Np Problem, Poincaré Conjecture, Collatz Conjecture, Hilbert's Problems, Catalan's Conjecture, Sierpinski Number, Generalized Riemann Hypothesis, Langlands Program, Weil Conjectures, Geometrization Conjecture, Aanderaa-karp-rosenberg Conjecture, Kepler Conjecture, Hadwiger Conjecture, Hodge Conjecture, Unsolved Problems in Mathematics, Bieberbach Conjecture, Cycle Double Cover, Farrell-jones Conjecture, Abc Conjecture, Lindelöf Hypothesis, Birch and Swinnerton-Dyer Conjecture, Erdős-straus Conjecture, Highly Composite Number, Unique Games Conjecture, Vizing's Conjecture, Sato-tate Conjecture, Schanuel's Conjecture, Carathéodory Conjecture, Baum-connes Conjecture, Hilbert-pólya Conjecture, List of Conjectures, Erdős-burr Conjecture, No-Three-In-Line Problem, Union-Closed Sets Conjecture, Generalized Poincaré Conjecture, Dyson Conjecture, Reconstruction Conjecture, Albertson Conjecture, Scheinerman's Conjecture, Erdős-faber-lovász Conjecture, Hedetniemi's Conjecture, Homological Conjectures in Commutative Algebra, Hilbert's Twelfth Problem, Standard Conjectures on Algebraic Cycles, Calogero Conjecture, Road Coloring Problem, Segal Conjecture, Oppenheim Conjecture, Singmaster's Conjecture, Artin's Conjecture on Primitive Roots, Pierce-birkhoff Conjecture, N!-Conjecture, Weinstein Conjecture, Graceful Labeling, Stark Conjectures, Brumer-stark Conjecture, Unsolved Problems in Computer Science, New Digraph Reconstruction Conjecture, Heawood Conjecture, Littlewood Conjecture, Serre's Multiplicity Conjectures, Jacobian Conjecture, Borel Conjecture, Novikov Conjecture, Conway's Thrackle Conjecture, Filling Area Conjecture, Montgomery's Pair Correlation Conjecture, Erdős Conjecture, Edgeworth Conjecture, Beal's Conjecture, Hirsch Conjecture, Leopoldt's Conjecture, Grothendieck-katz P-Curvature Conjecture, Tameness Conjecture, Erdős-graham Conjecture, Space Form, Weil Conjecture on Tamagawa Numbers, Erdős-gyárfás C...More: http://booksllc.net/?id=19344125 ... Read more

Product Description
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. ... Read more