Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 45,15
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
EUR 41,41
Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
Da: Antiquariat Bookfarm, Löbnitz, Germania
EUR 22,90
Quantità: 1 disponibili
Aggiungi al carrelloSoftcover. vii, 158 p. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. C-04160 9783540639701 Sprache: Englisch Gewicht in Gramm: 550.
EUR 42,79
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.
paperback. Condizione: New. In shrink wrap. Looks like an interesting title!
Lingua: Inglese
Editore: Berlin ; Heidelberg ; Singapore ; Tokyo ; New York ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Santa Clara : Springer, 1998
ISBN 10: 3540639705 ISBN 13: 9783540639701
Da: Antiquariat BehnkeBuch, Neu Kaliß, Germania
Membro dell'associazione: GIAQ
EUR 23,00
Quantità: 1 disponibili
Aggiungi al carrello23,5*15,5 cm. OBroschur. VII, 158 S. : graph. Darst. Kanten leicht berieben, Besitzervermerk auf fliegendem Blatt, vereinzelte Anstreichungen im Text (Textmarker), sonst gut. L16-5 ISBN 9783540639701 Wichtiger Hinweis: Aufgrund der EPR-Regelung zur Zeit KEIN Versand in EU-Länder. Due to EPR, there is currently no delivery to EU-countries. Sprache: Englisch Gewicht in Gramm: 450.
Lingua: Inglese
Editore: Springer Berlin Heidelberg Feb 1998, 1998
ISBN 10: 3540639705 ISBN 13: 9783540639701
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 42,79
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 172 pp. Englisch.
Lingua: Inglese
Editore: Springer Berlin Heidelberg, 1998
ISBN 10: 3540639705 ISBN 13: 9783540639701
Da: moluna, Greven, Germania
EUR 39,60
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 co.
Lingua: Inglese
Editore: Springer, Springer Vieweg Feb 1998, 1998
ISBN 10: 3540639705 ISBN 13: 9783540639701
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 42,79
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 172 pp. Englisch.