On the combinatorial structure of \(3N+1\) predecessor sets

DOI10.1016/0012-365X(94)00243-CzbMath0847.11009MaRDI QIDQ1910555

Günther J. Wirsching

Publication date: 24 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

densityasymptotic behaviourcombinatorial structure\(3N+ 1\)-problemcoefficient stopping time conjectureCollatz-problempredecessor set

Mathematics Subject Classification ID

Recurrences (11B37) Special sequences and polynomials (11B83)

Related Items (2)

A probabilistic model for the 5\(x\)+1 problem and related maps ⋮ Balls in constrained urns and Cantor-like sets

Cites Work

• Balls in constrained urns and Cantor-like sets
• How many numbers satisfy the \(3x+1\) conjecture?
• The 3x + 1 Problem and Its Generalizations
• A stopping time problem on the positive integers
• On the "3x + 1" Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the combinatorial structure of \(3N+1\) predecessor sets