Narrow your search

Library

UCLouvain (5)

UNamur (4)

ULiège (3)

UHasselt (2)

ULB (2)

VUB (2)

KBR (1)

KU Leuven (1)

UAntwerpen (1)


Resource type

book (5)


Language

English (4)

French (1)


Year
From To Submit

1998 (1)

1997 (1)

1995 (1)

1989 (1)

1974 (1)

Listing 1 - 5 of 5
Sort by
Probabilistic methods in combinatorial analysis
Author:
ISBN: 052145512X 9780521455121 Year: 1997 Volume: 56 Publisher: Cambridge : Cambridge University Press,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Probability approximations via the Poisson clumping heuristic
Author:
ISBN: 0387968997 1441930884 1475762836 3540968997 9780387968995 9783540968993 Year: 1989 Volume: 77 Publisher: New York (N.Y.): Springer,


Book
Probabilistic methods in combinatorics
Authors: ---
ISBN: 0122409604 9780122409608 Year: 1974 Volume: 17 Publisher: New York (N.Y.): Academic press

Logique, informatique et paradoxes
Author:
ISBN: 2902918941 9782902918942 Year: 1995 Publisher: Paris : Pour la Science,

Loading...
Export citation

Choose an application

Bookmark

Abstract

La logique est un domaine paradoxal: alors que l'on prétend y déterminer les règles à respecter pour ne pas tomber dans des paradoxes, c'est là que l'on en rencontre le plus ! Et ces paradoxes, qui font trembler les fondements des mathématiques, peuvent entraîner les calculs informatiques dans des maelströms infinis. Ce livre vous entraîne dans un parcours initiatique sur les chemins de l'indécidabilité, de l'aléatoire, de la déduction et de l'induction. Les découvertes récentes défrichent un univers où l'esprit tente de comprendre l'esprit, de le recréer et de s'en amuser.

The dynamical system generated by the 3n+1 function
Author:
ISBN: 3540639705 3540696776 9783540639701 Year: 1998 Volume: 1681. Publisher: Berlin : Springer-Verl.,

Loading...
Export citation

Choose an application

Bookmark

Abstract

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.

Listing 1 - 5 of 5
Sort by